Sciweavers

3820 search results - page 575 / 764
» Bounded Model Debugging
Sort
View
131
Voted
AAAI
2010
15 years 4 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
123
Voted
CCCG
2008
15 years 4 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
107
Voted
GRAPHICSINTERFACE
2007
15 years 4 months ago
Surface distance maps
We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point o...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, E...
140
Voted
ICVGIP
2008
15 years 4 months ago
Fragment Based Tracking for Scale and Orientation Adaptation
In this work, we propose a simple yet highly effective algorithm for tracking a target through significant scale and orientation change. We divide the target into a number of frag...
Viswanathan Srikrishnan, Tadinada Nagaraj, Subhasi...
104
Voted
SIROCCO
2008
15 years 4 months ago
Centralized Communication in Radio Networks with Strong Interference
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
Frantisek Galcík