Sciweavers

952 search results - page 139 / 191
» Computational complexity of stochastic programming problems
Sort
View
GLOBECOM
2006
IEEE
15 years 9 months ago
Sensor Localization from WLS Optimization with Closed-form Gradient and Hessian
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu
BIRTHDAY
2005
Springer
15 years 8 months ago
Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
David Harel, Hillel Kugler, Amir Pnueli
CVPR
2008
IEEE
16 years 5 months ago
Extracting a fluid dynamic texture and the background from video
Given the video of a still background occluded by a fluid dynamic texture (FDT), this paper addresses the problem of separating the video sequence into its two constituent layers....
Bernard Ghanem, Narendra Ahuja
FAC
2010
121views more  FAC 2010»
15 years 13 days ago
Blaming the client: on data refinement in the presence of pointers
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...
CP
2003
Springer
15 years 8 months ago
Using Constraints for Exploring Catalogs
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
François Laburthe, Yves Caseau