4843 search results - page 476 / 969 » The Shortcut Problem - Complexity and Approximation |
144
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
167
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
172
click to vote
FOCS
2007
IEEE
16 years 17 days ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
182
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
180
click to vote
VISUALIZATION
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...