Sciweavers

2740 search results - page 119 / 548
» Approximating Component Selection
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
14 years 11 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
INFOCOM
2012
IEEE
13 years 15 days ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
15 years 11 months ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
SBCCI
2009
ACM
145views VLSI» more  SBCCI 2009»
15 years 4 months ago
Pipelined successive approximation conversion (PSAC) with error correction for a CMOS ophthalmic sensor
The purpose of this work is the proposal of a 10-Bit / 1 MSPS Analog to Digital Converter (ADC) with error correction to match the requirements of a CMOS wavefront sensor for opht...
Frank Sill, Davies W. de Lima Monteiro
SAGA
2007
Springer
15 years 4 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...