Sciweavers

5326 search results - page 686 / 1066
» On what we can ensure
Sort
View
ML
2010
ACM
127views Machine Learning» more  ML 2010»
15 years 5 months ago
Stability and model selection in k-means clustering
Abstract Clustering Stability methods are a family of widely used model selection techniques for data clustering. Their unifying theme is that an appropriate model should result in...
Ohad Shamir, Naftali Tishby
MONET
2011
15 years 1 months ago
Jamming in Wireless Networks Under Uncertainty
— The problem of jamming plays an important role in ensuring the quality and security of wireless communications, especially at this moment when wireless networks are quickly bec...
Eitan Altman, Konstantin Avrachenkov, Andrey Garna...
ATAL
2008
Springer
15 years 8 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
EDBT
2010
ACM
155views Database» more  EDBT 2010»
16 years 1 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...