Sciweavers

3368 search results - page 163 / 674
» The Complexity of Query Reliability
Sort
View
IS
2012
14 years 2 months ago
View determinacy for preserving selected information in data transformations
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
Wenfei Fan, Floris Geerts, Lixiao Zheng
ACCV
2006
Springer
16 years 13 days ago
Fusion of 3D and Appearance Models for Fast Object Detection and Pose Estimation
Real-time estimation of a camera’s pose relative to an object is still an open problem. The difficulty stems from the need for fast and robust detection of known objects in the s...
Hesam Najafi, Yakup Genc, Nassir Navab
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 11 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
EDBT
2009
ACM
135views Database» more  EDBT 2009»
15 years 11 months ago
Provenance for nested subqueries
Data provenance is essential in applications such as scientific computing, curated databases, and data warehouses. Several systems have been developed that provide provenance fun...
Boris Glavic, Gustavo Alonso
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler