Sciweavers

1732 search results - page 181 / 347
» New Challenges in Parallel Optimization
Sort
View
124
Voted
AAAI
2006
15 years 4 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
144
Voted
CVPR
2009
IEEE
16 years 10 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
124
Voted
IROS
2009
IEEE
128views Robotics» more  IROS 2009»
15 years 9 months ago
Motion planning for active cannulas
— An active cannula is a medical device composed of thin, pre-curved, telescoping tubes that may enable many new surgical procedures. Planning optimal motions for these devices i...
Lisa A. Lyons, Robert J. Webster, Ron Alterovitz
134
Voted
C3S2E
2009
ACM
15 years 6 months ago
The promise of solid state disks: increasing efficiency and reducing cost of DBMS processing
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
Karsten Schmidt 0002, Yi Ou, Theo Härder
141
Voted
AAAI
2006
15 years 4 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...