Sciweavers

1100 search results - page 134 / 220
» Approximate distance oracles
Sort
View
SPIRE
2010
Springer
14 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
ICDM
2009
IEEE
165views Data Mining» more  ICDM 2009»
14 years 7 months ago
Audio Classification of Bird Species: A Statistical Manifold Approach
Our goal is to automatically identify which species of bird is present in an audio recording using supervised learning. Devising effective algorithms for bird species classificati...
Forrest Briggs, Raviv Raich, Xiaoli Z. Fern
TOG
2010
153views more  TOG 2010»
14 years 4 months ago
Content-adaptive parallax barriers: optimizing dual-layer 3D displays using low-rank light field factorization
We optimize automultiscopic displays built by stacking a pair of modified LCD panels. To date, such dual-stacked LCDs have used heuristic parallax barriers for view-dependent imag...
Douglas Lanman, Matthew Hirsch, Yunhee Kim, Ramesh...
SIGMOD
2011
ACM
247views Database» more  SIGMOD 2011»
14 years 27 days ago
Collective spatial keyword querying
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and s...
Xin Cao, Gao Cong, Christian S. Jensen, Beng Chin ...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
15 years 10 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li