4131 search results - page 40 / 827 » Compactness in Topology and Computation |
153
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
102
click to vote
DAC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper we propose a test compaction method for path delay faults in a logic circuit. The method generates a compact set of two-pattern tests for faults on long paths select...
121
click to vote
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
119
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
138
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...