Sciweavers

91 search results - page 18 / 19
» A Threshold of ln n for Approximating Set Cover
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
A Surface-Growing Approach to Multi-View Stereo Reconstruction
We present a new approach to reconstruct the shape of a 3D object or scene from a set of calibrated images. The central idea of our method is to combine the topological flexibilit...
Martin Habbecke, Leif Kobbelt
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 9 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
FOCS
2004
IEEE
13 years 11 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
PODS
2005
ACM
96views Database» more  PODS 2005»
14 years 1 months ago
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
14 years 2 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....