3875 search results - page 331 / 775 » Approximation algorithms for the 0-extension problem |
187
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
195
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
174
click to vote
SIGCOMM
1999
ACM
15 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
144
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
164
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...