Sciweavers

5169 search results - page 9 / 1034
» Locality approximation using time
Sort
View
CVPR
2007
IEEE
14 years 8 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
RECOMB
1997
Springer
13 years 11 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
IAT
2006
IEEE
14 years 23 days ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 8 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
ECCV
2010
Springer
13 years 11 months ago
Using Partial Edge Contour Matches for Efficient Object Category Localization
Abstract. We propose a method for object category localization by partially matching edge contours to a single shape prototype of the category. Previous work in this area either re...
Hayko Riemenschneider, Michael Donoser, and Horst ...