Sciweavers

9849 search results - page 91 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
130
Voted
TIT
2010
154views Education» more  TIT 2010»
14 years 11 months ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...
ICASSP
2011
IEEE
14 years 8 months ago
Discriminative simplification of mixture models
Simplification of mixture models has recently emerged as an important issue in the field of statistical learning. The heavy computational demands of using large order models dro...
Yossi Bar-Yosef, Yuval Bistritz
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 10 months ago
Stability of Feature Selection Algorithms
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
KAIS
2007
97views more  KAIS 2007»
15 years 4 months ago
Stability of feature selection algorithms: a study on high-dimensional spaces
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 2 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...