Sciweavers

2342 search results - page 11 / 469
» Sublinear geometric algorithms
Sort
View
ESCAPE
2007
Springer
266views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
CR-precis: A Deterministic Summary Structure for Update Data Streams
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
Sumit Ganguly, Anirban Majumder
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost
CORR
2002
Springer
104views Education» more  CORR 2002»
13 years 7 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
PAMI
2006
132views more  PAMI 2006»
13 years 7 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
IFIP
2004
Springer
14 years 28 days ago
Solving Geometrical Place Problems by using Evolutionary Algorithms
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
Crina Grosan