Sciweavers

7006 search results - page 1076 / 1402
» Approximation Algorithms
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
16 years 7 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
193
Voted
SIPS
2008
IEEE
16 years 1 months ago
Unified decoder architecture for LDPC/turbo codes
Low-density parity-check (LDPC) codes on par with convolutional turbo codes (CTC) are two of the most powerful error correction codes known to perform very close to the Shannon li...
Yang Sun, Joseph R. Cavallaro
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
16 years 6 days ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
« Prev « First page 1076 / 1402 Last » Next »