Sciweavers

126 search results - page 2 / 26
» Finding minimal bases in arbitrary spline spaces
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 5 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 6 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
13 years 3 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis
ICIP
2002
IEEE
14 years 6 months ago
Multigrid image reconstruction from arbitrarily spaced samples
We propose a novel multiresolution-multigrid based signal reconstruction method from arbitrarily spaced samples. The signal is reconstructed on a uniform grid using B-splines basi...
Michael Sühling, Michael Unser, Muthuvel Arig...
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 5 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru