Sciweavers

2342 search results - page 9 / 469
» Sublinear geometric algorithms
Sort
View
CVPR
2007
IEEE
14 years 9 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
DCC
2002
IEEE
14 years 7 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
IJFCS
2006
87views more  IJFCS 2006»
13 years 7 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
ASIACRYPT
2004
Springer
14 years 29 days ago
A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size Against Self-Defensive Pirates
We propose a public-key traitor tracing scheme in which (1) the size of a ciphertext is sublinear in the number of receivers and (2) black-box tracing is efficiently achieved again...
Tatsuyuki Matsushita, Hideki Imai
RECOMB
2006
Springer
14 years 7 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret