3874 search results - page 301 / 775 » Approximation Algorithms for k-hurdle Problems |
146
click to vote
PAMI
2011
14 years 11 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
136
Voted
EDBT
2006
ACM
16 years 5 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...
137
Voted
SIGCOMM
1999
ACM
15 years 9 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...
125
click to vote
STOC
2007
ACM
16 years 5 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...
130
click to vote
IPPS
2006
IEEE
15 years 11 months 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...