Sciweavers

692 search results - page 49 / 139
» BDD minimization for approximate computing
Sort
View
IJCAI
2003
15 years 5 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
TPDS
2008
136views more  TPDS 2008»
15 years 3 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
IJCV
2012
13 years 6 months ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto
CVPR
2005
IEEE
16 years 5 months ago
Robust Instantaneous Rigid Motion Estimation
A novel, nonlinear algorithm is introduced for the estimation of rigid camera motion from instantaneous velocity measurements in the calibrated case. It is shown that by minimizin...
Karl Pauwels, Marc M. Van Hulle
INFOCOM
2003
IEEE
15 years 9 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...