Sciweavers

401 search results - page 21 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
PAMI
2006
156views more  PAMI 2006»
14 years 9 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
DOLAP
2004
ACM
15 years 3 months ago
Experimental evidence on partitioning in parallel data warehouses
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
Pedro Furtado
67
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 9 months ago
The Fundamental Problem with the Building Block Hypothesis
Skepticism of the building block hypothesis has previously been expressed on account of the weak theoretical foundations of this hypothesis and anomalies in the empirical record o...
Keki M. Burjorjee
ALGOSENSORS
2006
Springer
15 years 1 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
105
Voted
CORR
2007
Springer
143views Education» more  CORR 2007»
14 years 9 months ago
An Approximation Algorithm for Shortest Descending Paths
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw