Sciweavers

4377 search results - page 830 / 876
» Mass problems and randomness
Sort
View
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
16 years 29 days ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
CCS
2009
ACM
16 years 29 days ago
NISAN: network information service for anonymization networks
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
Andriy Panchenko, Stefan Richter, Arne Rache
STACS
2009
Springer
16 years 29 days ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
FOCS
2009
IEEE
16 years 28 days ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ICASSP
2009
IEEE
16 years 28 days ago
Scalable distributed source coding
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
Ankur Saxena, Kenneth Rose