Sciweavers

6274 search results - page 156 / 1255
» From query complexity to computational complexity
Sort
View
RANDOM
2001
Springer
15 years 8 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
PODS
2004
ACM
115views Database» more  PODS 2004»
16 years 4 months ago
Foundations of Semantic Web Databases
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework ...
Claudio Gutiérrez, Carlos A. Hurtado, Alber...
ICCV
2007
IEEE
16 years 6 months ago
A Divide-and-Conquer Approach to 3D Object Reconstruction from Line Drawings
3D object reconstruction from a single 2D line drawing is an important problem in both computer vision and graphics. Many methods have been put forward to solve this problem, but ...
Yu Chen, Jianzhuang Liu, Xiaoou Tang
PVLDB
2008
100views more  PVLDB 2008»
15 years 3 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
COCOON
2007
Springer
15 years 10 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang