Sciweavers

63 search results - page 10 / 13
» Deterministic algorithms for sampling count data
Sort
View
ILP
2004
Springer
14 years 25 days ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
TCBB
2008
126views more  TCBB 2008»
13 years 7 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
ICCV
2009
IEEE
15 years 13 days ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 7 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
SCALESPACE
2009
Springer
14 years 2 months ago
Bregman-EM-TV Methods with Application to Optical Nanoscopy
Abstract. Measurements in nanoscopic imaging suffer from blurring effects concerning different point spread functions (PSF). Some apparatus even have PSFs that are locally depend...
Christoph Brune, Alex Sawatzky, Martin Burger