Sciweavers

3341 search results - page 162 / 669
» On Bounded Queries and Approximation
Sort
View
99
Voted
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 10 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 2 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
106
Voted
ICIP
2004
IEEE
15 years 11 months ago
Rate-distortion bounds for motion compensated rate scalable video coders
In this paper, we derive and evaluate theoretical ratedistortion performance bounds for scalable video compression algorithms which use a single motion-compensated prediction (MCP...
Gregory W. Cook, Josep Prades-Nebot, Edward J. Del...
84
Voted
COLT
1993
Springer
15 years 2 months ago
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
Peter L. Bartlett
78
Voted
COLT
1994
Springer
15 years 2 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...