Sciweavers

1004 search results - page 183 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 5 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 10 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
COMPLIFE
2006
Springer
15 years 9 months ago
Beating the Noise: New Statistical Methods for Detecting Signals in MALDI-TOF Spectra Below Noise Level
Background: The computer-assisted detection of small molecules by mass spectrometry in biological samples provides a snapshot of thousands of peptides, protein fragments and prote...
Tim O. F. Conrad, Alexander Leichtle, Andre Hageh&...
163
Voted
DEBS
2008
ACM
15 years 7 months ago
Replica placement for high availability in distributed stream processing systems
A significant number of emerging on-line data analysis applications require the processing of data streams, large amounts of data that get updated continuously, to generate output...
Thomas Repantis, Vana Kalogeraki
139
Voted
PODC
2009
ACM
16 years 5 months ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer