Sciweavers

2192 search results - page 107 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IPSN
2005
Springer
14 years 1 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
ISCI
2008
117views more  ISCI 2008»
13 years 8 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao
JMLR
2010
115views more  JMLR 2010»
13 years 6 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
JMLR
2006
125views more  JMLR 2006»
13 years 8 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
IROS
2007
IEEE
96views Robotics» more  IROS 2007»
14 years 2 months ago
Towards robotic self-reassembly after explosion
— This paper introduces a new challenge problem, designing robotic systems to recover after disassembly from high energy events. Implementation of a camera-based localization alg...
Mark Yim, Babak Shirmohammadi, Jimmy Sastra, Micha...