2168 search results - page 279 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
140
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
159
click to vote
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
Many of the computer vision algorithms have been posed in various forms of differential equations, derived from minimization of specific energy functionals, and the finite eleme...
139
click to vote
ADBIS
2009
Springer
15 years 11 months ago
2009
Springer
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
162
click to vote
ASPLOS
2010
ACM
15 years 9 months ago
2010
ACM
Heterogeneous computing combines general purpose CPUs with accelerators to efficiently execute both sequential control-intensive and data-parallel phases of applications. Existin...
120
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...