Sciweavers

5210 search results - page 781 / 1042
» Exact geometric computation
Sort
View
131
Voted
NIPS
2008
15 years 5 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
137
Voted
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
15 years 5 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty
124
Voted
AAAI
2004
15 years 5 months ago
On Odd and Even Cycles in Normal Logic Programs
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
Fangzhen Lin, Xishun Zhao
APBC
2004
117views Bioinformatics» more  APBC 2004»
15 years 5 months ago
Detecting Local Symmetry Axis in 3-dimensional Virus Structures
This paper presents an efficient computational method to identify a local symmetry axis in 3-dimensional viral structures obtained using electron cryomicroscopy. Local symmetry is...
Jing He, Desh Ranjan, Wen Jiang, Wah Chiu, Michael...
156
Voted
AIPS
2006
15 years 5 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith