5169 search results - page 147 / 1034 » Locality approximation using time |
144
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
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...
134
Voted
CVPR
2009
IEEE
17 years 22 hour ago
2009
IEEE
This paper introduces a class of correlation filters called
Average of Synthetic Exact Filters (ASEF). For ASEF, the
correlation output is completely specified for each training
...
142
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
178
Voted
SMI
2003
IEEE
15 years 10 months ago
2003
IEEE
Skeleton is a lower dimensional shape description of an object. The requirements of a skeleton differ with applications. For example, object recognition requires skeletons with pr...
125
Voted
CSB
2005
IEEE
15 years 10 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...