Sciweavers

1170 search results - page 101 / 234
» How Fast Is Too Fast
Sort
View
ICCV
2009
IEEE
1022views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Kernelized Locality-Sensitive Hashing for Scalable Image Search
Fast retrieval methods are critical for large-scale and data-driven vision applications. Recent work has explored ways to embed high-dimensional features or complex distance fun...
Brian Kulis, Kristen Grauman
131
Voted
ICCV
2001
IEEE
16 years 5 months ago
Human Tracking with Mixtures of Trees
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
Sergey Ioffe, David A. Forsyth
211
Voted
ICDE
2003
IEEE
144views Database» more  ICDE 2003»
16 years 4 months ago
Scalable template-based query containment checking for web semantic caches
Semantic caches, originally proposed for client-server database systems, are being recently deployed to accelerate the serving of dynamic web content by transparently caching data...
Khalil Amiri, Sanghyun Park, Renu Tewari, Sriram P...
OSDI
2008
ACM
16 years 3 months ago
Quanto: Tracking Energy in Networked Embedded Systems
We present Quanto, a network-wide time and energy profiler for embedded network devices. By combining well-defined interfaces for hardware power states, fast high-resolution energ...
Rodrigo Fonseca, Prabal Dutta, Philip Levis, Ion S...
SIGMOD
2002
ACM
84views Database» more  SIGMOD 2002»
16 years 3 months ago
Skew handling techniques in sort-merge join
Joins are among the most frequently executed operations. Several fast join algorithms have been developed and extensively studied; these can be categorized as sort-merge, hash-bas...
Wei Li, Dengfeng Gao, Richard T. Snodgrass