Sciweavers

3341 search results - page 130 / 669
» On Bounded Queries and Approximation
Sort
View
FCT
2005
Springer
15 years 3 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
15 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
ICDE
2003
IEEE
211views Database» more  ICDE 2003»
15 years 11 months ago
Capturing Sensor-Generated Time Series with Quality Guarantees
We are interested in capturing time series generated by small wireless electronic sensors. Battery-operated sensors must avoid heavy use of their wireless radio which is a key cau...
Iosif Lazaridis, Sharad Mehrotra
GIS
2007
ACM
15 years 11 months ago
An interactive framework for raster data spatial joins
Many Geographic Information System (GIS) applications must handle large geospatial datasets stored in raster representation. Spatial joins over raster data are important queries i...
Wan D. Bae, Petr Vojtechovský, Shayma Alkob...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 2 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...