1576 search results - page 19 / 316 » Streaming Algorithms for Independent Sets |
MFCS
2004
Springer
15 years 3 months 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...
IPPS
2005
IEEE
15 years 3 months 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....
104
click to vote
ISM
2008
IEEE
15 years 4 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...
APPROX
2008
Springer
14 years 11 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...
SODA
2010
ACM
15 years 7 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...