Sciweavers

554 search results - page 72 / 111
» Approximate Probabilistic Model Checking
Sort
View
TSP
2010
13 years 2 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ICDCS
2006
IEEE
14 years 1 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ECCV
2004
Springer
14 years 9 months ago
A Statistical Model for General Contextual Object Recognition
We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects....
Peter Carbonetto, Nando de Freitas, Kobus Barnard
IROS
2007
IEEE
131views Robotics» more  IROS 2007»
14 years 1 months ago
A hybrid approach for complete motion planning
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
PAMI
2002
157views more  PAMI 2002»
13 years 7 months ago
Automatic Recognition of Handwritten Numerical Strings: A Recognition and Verification Strategy
A modular system to recognize handwritten numerical strings is proposed. It uses a segmentation-based recognition approach and a Recognition and Verification strategy. The approach...
Luiz E. Soares de Oliveira, Robert Sabourin, Fl&aa...