Sciweavers

193 search results - page 23 / 39
» A Tractable Class of Abduction Problems
Sort
View
ICRA
2006
IEEE
98views Robotics» more  ICRA 2006»
15 years 3 months ago
Sensor Selection and Placement for Failure Diagnosis in Networked Aerial Robots
Abstract—Unmanned aerial vehicles (UAVs) represent an important class of networked robotic applications that must be both highly dependable and autonomous. This paper addresses s...
Nagarajan Kandasamy, Fadi A. Aloul, Tak-John Koo
EOR
2008
136views more  EOR 2008»
14 years 9 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
ECCV
2010
Springer
15 years 2 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
CVPR
2007
IEEE
15 years 11 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
JAIR
2008
148views more  JAIR 2008»
14 years 9 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang