Sciweavers

2600 search results - page 482 / 520
» Clustering with or without the Approximation
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
NETCOOP
2009
Springer
14 years 2 months ago
Optimal File Splitting for Wireless Networks with Concurrent Access
The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a p...
Gerard Hoekstra, Rob van der Mei, Yoni Nazarathy, ...
SAGA
2009
Springer
14 years 2 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
IMC
2009
ACM
14 years 2 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...