Sciweavers

64 search results - page 2 / 13
» Comparison of Energy Minimization Algorithms for Highly Conn...
Sort
View
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
13 years 10 months ago
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition
We describe a part-based object-recognition framework, specialized to mining complex 3D objects from detailed 3D images. Objects are modeled as a collection of parts together with...
Frank DiMaio, Jude W. Shavlik
CIDM
2009
IEEE
13 years 8 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
CVPR
2009
IEEE
14 years 11 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
ROBOCOMM
2007
IEEE
13 years 10 months ago
Minimal energy path planning for wireless robots
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...
Chia-Ching Ooi, Christian Schindelhauer
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 6 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer