1576 search results - page 19 / 316 » Streaming Algorithms for Independent Sets |
187
click to vote
MFCS
2004
Springer
16 years 11 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
201
click to vote
IPPS
2005
IEEE
16 years 18 days ago
2005
IEEE
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
182
Voted
ISM
2008
IEEE
16 years 1 months ago
2008
IEEE
Error concealment is very important for video communication as an application-layer error control mechanism which can be used independently of the underlying communication infrast...
171
Voted
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
179
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...