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

類屬

書目名稱Algorithms and Computation影響因子(影響力)




書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名




書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度




書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithms and Computation被引頻次




書目名稱Algorithms and Computation被引頻次學(xué)科排名




書目名稱Algorithms and Computation年度引用




書目名稱Algorithms and Computation年度引用學(xué)科排名




書目名稱Algorithms and Computation讀者反饋




書目名稱Algorithms and Computation讀者反饋學(xué)科排名

noxious

Gentry

吞沒

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

手銬

觀察

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

致敬

拋媚眼

Carcinoma

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

ureter

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