Sciweavers

17920 search results - page 201 / 3584
» Recentering computer science
Sort
View
FOCS
2000
IEEE
15 years 9 months ago
Clustering Data Streams
The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis o...
Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan ...
142
Voted
IFIPTCS
2000
15 years 8 months ago
List Decoding: Algorithms and Applications
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
Madhu Sudan
139
Voted
TCS
2010
15 years 3 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
DLT
2009
15 years 2 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
131
Voted
GI
2009
Springer
15 years 2 months ago
Putting Privacy Pictograms into Practice - a European Perspective
: Recent proposals for privacy pictograms show a growing interest of simplifying privacy-related statements. Such pictograms can be useful to enhance the users' understanding ...
Marit Hansen