Sciweavers

534 search results - page 54 / 107
» Efficient polynomial L-approximations
Sort
View
CDC
2009
IEEE
158views Control Systems» more  CDC 2009»
13 years 12 months ago
Multiple target detection using Bayesian learning
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
Sujit Nair, Konda Reddy Chevva, Houman Owhadi, Jer...
CP
2006
Springer
13 years 11 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
AAAI
2006
13 years 9 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
TVCG
2008
103views more  TVCG 2008»
13 years 7 months ago
Practical Box Splines for Reconstruction on the Body Centered Cubic Lattice
We introduce a family of box splines for efficient, accurate and smooth reconstruction of volumetric data sampled on the Body Centered Cubic (BCC) lattice, which is the favorable v...
Alireza Entezari, Dimitri Van De Ville, Torsten M&...
ICCV
2009
IEEE
15 years 25 days ago
An Algebraic Approach to Affine Registration of Point Sets
This paper proposes a new affine registration algorithm for matching two point sets in IR2 or IR3. The input point sets are represented as probability density functions, using e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...