Sciweavers

3055 search results - page 594 / 611
» Randomized Search Trees
Sort
View
ICASSP
2011
IEEE
13 years 20 days ago
Rapid image retrieval for mobile location recognition
Recognizing the location and orientation of a mobile device from captured images is a promising application of image retrieval algorithms. Matching the query images to an existing...
Georg Schroth, Anas Al-Nuaimi, Robert Huitl, Flori...
ASPLOS
2011
ACM
13 years 17 days ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
NAR
2011
159views Computer Vision» more  NAR 2011»
12 years 11 months ago
SuperSweet - a resource on natural and artificial sweetening agents
A vast number of sweet tasting molecules are known, encompassing small compounds, carbohydrates, D-amino acids and large proteins. Carbohydrates play a particularly big role in hu...
Jessica Ahmed, Saskia Preissner, Mathias Dunkel, C...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 8 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson