Sciweavers

5153 search results - page 757 / 1031
» Introduction to Randomized Algorithms
Sort
View
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 7 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
14 years 3 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
16 years 4 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 4 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
MOBICOM
2009
ACM
15 years 10 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang