3020 search results - page 379 / 604 » Optimal partition trees |
163
click to vote
IPCO
2007
15 years 8 months ago
2007
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
180
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
155
click to vote
NIPS
2007
15 years 8 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
182
click to vote
NIPS
2004
15 years 8 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
230
click to vote
IAJIT
2008
15 years 6 months ago
2008
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...