2191 search results - page 134 / 439 » Improving the Efficiency of Non-Deterministic Computations |
189
click to vote
ISCA
2002
IEEE
15 years 14 days ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
107
Voted
AINA
2008
IEEE
15 years 7 months ago
2008
IEEE
Wireless Sensor Networks (WSN) have specific constraints and stringent requirements in contrast to traditional wired and wireless computer networks. Among these specific requireme...
111
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
110
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
127
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...