1480 search results - page 257 / 296 » Distributed algorithms for weighted problems in sparse graph... |
153
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
147
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
140
click to vote
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
157
Voted
ICPP
2009
IEEE
15 years 9 months ago
2009
IEEE
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
172
click to vote
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...