7129 search results - page 477 / 1426 » Approximation Algorithms for Treewidth |
144
click to vote
ICS
1989
Tsinghua U.
15 years 10 months ago
1989
Tsinghua U.
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
213
click to vote
ACST
2006
15 years 8 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
152
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
188
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
172
click to vote
CN
2006
2006
A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms
15 years 6 months ago
This paper presents an assessment of the communication overheads of IPsec and evaluates the feasibility of deploying it on handheld devices for the UMTS architecture. A wide range...