Sciweavers

1576 search results - page 38 / 316
» Streaming Algorithms for Independent Sets
Sort
View
IEAAIE
2009
Springer
15 years 8 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
SIGMOD
2005
ACM
135views Database» more  SIGMOD 2005»
16 years 1 months ago
Mining data streams: a review
The recent advances in hardware and software have enabled the capture of different measurements of data in a wide range of fields. These measurements are generated continuously an...
Mohamed Medhat Gaber, Arkady B. Zaslavsky, Shonali...
COMPGEOM
2007
ACM
15 years 5 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 3 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
APPROX
2008
Springer
94views Algorithms» more  APPROX 2008»
15 years 3 months ago
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
Eden Chlamtac, Gyanit Singh