Sciweavers

4843 search results - page 215 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
138
Voted
APPML
2008
77views more  APPML 2008»
15 years 3 months ago
A controllability approach to shape identification
The main goal of this article is to discuss a controllability approach to the image matching / shape identification problem, an important issue in many applications, medical ones ...
Robert Azencott, Roland Glowinski, A. M. Ramos
130
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 3 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
142
Voted
ICALP
2009
Springer
16 years 3 months ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
115
Voted
NIPS
2007
15 years 4 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 4 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein