Sciweavers

4114 search results - page 409 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
UAI
1998
15 years 8 months ago
Learning Mixtures of DAG Models
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...
Bo Thiesson, Christopher Meek, David Maxwell Chick...
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 7 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
INTEGRATION
2008
89views more  INTEGRATION 2008»
15 years 6 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
JMIV
2008
268views more  JMIV 2008»
15 years 6 months ago
A Fast Marching Method for the Area Based Affine Distance
In this paper we consider the problem of computing the area-based affine distance for a convex domain in the plane. Since this affine distance satisfies a non-homogeneous Monge-Amp...
Moacyr A. H. B. da Silva, Ralph Teixeira, Sin&eacu...
ECCV
2006
Springer
16 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...