Sciweavers

70 search results - page 2 / 14
» Improved Algorithms for Partial Curve Matching
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 5 months ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
14 years 1 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...
FOCS
2008
IEEE
13 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICIP
1998
IEEE
13 years 9 months ago
Image Warping using Adaptive Partial Matching
The block-matching motion estimation algorithm using a translational motion model cannot provide acceptable image quality in low bit-rate coding. To improve coding performance, we ...
Dong-Keun Lim, Yo-Sung Ho
ICPR
2008
IEEE
14 years 6 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...