2600 search results - page 482 / 520 » Clustering with or without the Approximation |
184
Voted
CIKM
2009
Springer
16 years 20 days ago
2009
Springer
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...
191
click to vote
CRYPTO
2009
Springer
16 years 20 days ago
2009
Springer
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...
161
click to vote
NETCOOP
2009
Springer
16 years 19 days ago
2009
Springer
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...
228
click to vote
SAGA
2009
Springer
16 years 19 days ago
2009
Springer
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...
173
click to vote
IMC
2009
ACM
16 years 18 days ago
2009
ACM
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...