Sciweavers

340 search results - page 35 / 68
» Clustering with Lower Bound on Similarity
Sort
View
124
Voted
IAT
2009
IEEE
15 years 7 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
130
Voted
JSSPP
2007
Springer
15 years 7 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
124
Voted
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
85
Voted
ICIP
2005
IEEE
16 years 2 months ago
Variational segmentation of color images
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...
Nikolaos Nasios, Adrian G. Bors
ICML
2007
IEEE
16 years 1 months ago
Multi-armed bandit problems with dependent arms
We provide a framework to exploit dependencies among arms in multi-armed bandit problems, when the dependencies are in the form of a generative model on clusters of arms. We find ...
Sandeep Pandey, Deepayan Chakrabarti, Deepak Agarw...