Sciweavers

357 search results - page 5 / 72
» An Algebraic Approach to the Complexity of Generalized Conju...
Sort
View
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
14 years 1 months ago
A Lie Algebraic Approach for Consistent Pose Registration for General Euclidean Motion
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
Motilal Agrawal
ICDT
2010
ACM
180views Database» more  ICDT 2010»
14 years 5 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen
DBPL
2009
Springer
144views Database» more  DBPL 2009»
14 years 2 months ago
General Database Statistics Using Entropy Maximization
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
Raghav Kaushik, Christopher Ré, Dan Suciu
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 10 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
IPL
2006
99views more  IPL 2006»
13 years 7 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti