Sciweavers

232 search results - page 31 / 47
» Randomized Kinodynamic Planning
Sort
View
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 10 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 10 months ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
14 years 1 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 10 months ago
Query Processing for SQL Updates
A rich set of concepts and techniques has been developed in the context of query processing for the efficient and robust execution of queries. So far, this work has mostly focused...
César A. Galindo-Legaria, Stefano Stefani, ...