Sciweavers

3875 search results - page 330 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
On synthesizing cross ambiguity functions
The cross ambiguity function (CAF) arises in many areas such as radar/sonar and communications when correlation processing is performed in the presence of a Doppler frequency shif...
Hao He, Petre Stoica, Jian Li
CORR
2006
Springer
140views Education» more  CORR 2006»
15 years 6 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
ICDT
2005
ACM
128views Database» more  ICDT 2005»
16 years 10 days ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 8 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 7 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...