Sciweavers

725 search results - page 111 / 145
» Approximate Join Processing Over Data Streams
Sort
View
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 8 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 9 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ICASSP
2011
IEEE
13 years 12 days ago
Interference alignment in single-beam MIMO networks via homotopy continuation
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
Oscar Gonzalez, Ignacio Santamaría
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 8 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
14 years 10 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng