Sciweavers

69 search results - page 7 / 14
» Constant-factor approximation algorithms for identifying dyn...
Sort
View
UAI
1997
13 years 8 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
CVPR
2006
IEEE
14 years 1 months ago
Shape from Dynamic Texture for Planes
We propose a method for recovering the affine geometry of a dynamically textured plane from a video sequence taken by an uncalibrated, fixed, perspective camera. Some instances ...
Yaser Sheikh, Niels C. Haering, Mubarak Shah
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
IROS
2007
IEEE
193views Robotics» more  IROS 2007»
14 years 1 months ago
Analyzing gaussian proposal distributions for mapping with rao-blackwellized particle filters
Abstract— Particle filters are a frequently used filtering technique in the robotics community. They have been successfully applied to problems such as localization, mapping, o...
Cyrill Stachniss, Giorgio Grisetti, Wolfram Burgar...
WSC
2008
13 years 9 months ago
Dynamic entity distribution in parallel discrete event simulation
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
Michael Slavik, Imad Mahgoub, Ahmed Badi