找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms and Computation; 16th International S Xiaotie Deng,Ding-Zhu Du Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 200

[复制链接]
查看: 44812|回复: 62
发表于 2025-3-21 18:35:48 | 显示全部楼层 |阅读模式
期刊全称Algorithms and Computation
期刊简称16th International S
影响因子2023Xiaotie Deng,Ding-Zhu Du
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithms and Computation; 16th International S Xiaotie Deng,Ding-Zhu Du Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 200
Pindex Conference proceedings 2005
The information of publication is updating

书目名称Algorithms and Computation影响因子(影响力)




书目名称Algorithms and Computation影响因子(影响力)学科排名




书目名称Algorithms and Computation网络公开度




书目名称Algorithms and Computation网络公开度学科排名




书目名称Algorithms and Computation被引频次




书目名称Algorithms and Computation被引频次学科排名




书目名称Algorithms and Computation年度引用




书目名称Algorithms and Computation年度引用学科排名




书目名称Algorithms and Computation读者反馈




书目名称Algorithms and Computation读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:17:18 | 显示全部楼层
发表于 2025-3-22 02:41:53 | 显示全部楼层
发表于 2025-3-22 07:48:07 | 显示全部楼层
The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentationns challenging in many medical image analysis applications. In this paper, we study several . problems captured by an interesting type of geometric graphs called . in the .-D discrete space (. ≥ 3). The LNS problems model the simultaneous detection of multiple mutually related surfaces in three or h
发表于 2025-3-22 10:42:24 | 显示全部楼层
发表于 2025-3-22 13:58:55 | 显示全部楼层
Casting an Object with a Coreng directions. To manufacture more complicated objects, the cast may also have a side core to be removed in a direction skewed to the parting directions. In this paper, given an object and the parting and side core directions, we give necessary and sufficient conditions to verify whether a cast can
发表于 2025-3-22 18:22:07 | 显示全部楼层
发表于 2025-3-22 21:36:51 | 显示全部楼层
发表于 2025-3-23 01:40:50 | 显示全部楼层
Minimizing a Monotone Concave Function with Laminar Covering Constraintsmand function . →ℝ., and a monotone concave cost function ., we consider the problem of finding a minimum-cost . such that .(.)≥ .(.) for all .. Here we do not assume that the cost function . is differentiable or even continuous. We show that the problem can be solved in O(...) time if . can be deco
发表于 2025-3-23 08:08:46 | 显示全部楼层
Almost Optimal Solutions for Bin Coloring Problemsotivated from several applications in networking. For the MinBC problem, we first show that it is NP-complete, and then present two near linear time approximation algorithms to achieve almost optimal solutions, i.e., no more than .+2 and .+1 respectively, where . is the optimal solution. For the OMa
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-11 12:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表