Sciweavers

3406 search results - page 399 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 11 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
JMLR
2010
115views more  JMLR 2010»
15 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
VISUALIZATION
1997
IEEE
15 years 10 months ago
Efficient subdivision of finite-element datasets into consistent tetrahedra
This paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while ...
Guy Albertelli, Roger Crawfis
NIPS
2008
15 years 8 months ago
Tighter Bounds for Structured Estimation
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
Olivier Chapelle, Chuong B. Do, Quoc V. Le, Alexan...
GLVLSI
2007
IEEE
135views VLSI» more  GLVLSI 2007»
16 years 28 days ago
Exact sat-based toffoli network synthesis
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
Daniel Große, Xiaobo Chen, Gerhard W. Dueck,...