716 search results - page 55 / 144 » Algorithmic Issues in Coding Theory |
95
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
144
Voted
JACM
2006
15 years 2 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
115
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
126
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
115
Voted
SIGIR
2002
ACM
15 years 2 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...