Sciweavers

3341 search results - page 216 / 669
» On Bounded Queries and Approximation
Sort
View
FOCS
2009
IEEE
16 years 19 days ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 11 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
15 years 11 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 7 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
SIGMOD
2005
ACM
99views Database» more  SIGMOD 2005»
16 years 6 months ago
Query answering exploiting structural properties
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
Francesco Scarcello