2107 search results - page 114 / 422 » Computing Small Search Numbers in Linear Time |
127
Voted
WSCG
2001
15 years 4 months ago
2001
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
124
Voted
DEXA
2006
Springer
15 years 5 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
102
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Load balancing is a common approach for task assignment in distributed architectures. In this paper, we show that the degree of inefficiency in load balancing designs is highly...
117
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
108
Voted
LCN
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...