Sciweavers

1717 search results - page 115 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
COMPGEOM
2007
ACM
15 years 10 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 7 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
CMPB
2010
152views more  CMPB 2010»
15 years 6 months ago
Fast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
Marc Modat, Gerard R. Ridgway, Zeike A. Taylor, Ma...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
16 years 6 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd