Sciweavers

2714 search results - page 506 / 543
» Approximation Schemes for Scheduling
Sort
View
133
Voted
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 27 days ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
123
Voted
RECOMB
2006
Springer
16 years 24 days ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
PODS
2004
ACM
207views Database» more  PODS 2004»
16 years 19 days ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
123
Voted

Publication
353views
15 years 10 months ago
Shape from Shading with Perspective Projection
Most conventional SFS (shape from shading) algorithms have been developed under the assumption of orthographic projection. However, the assumption is not valid when an object is no...
Kyoung Mu Lee (Seoul National University), C.-C. J...
96
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar