Sciweavers

105 search results - page 7 / 21
» Persistence in discrete optimization under data uncertainty
Sort
View
COMPGEOM
2011
ACM
14 years 1 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
83
Voted
BMCBI
2008
126views more  BMCBI 2008»
14 years 9 months ago
FCI: an R-based algorithm for evaluating uncertainty of absolute real-time PCR quantification
Background: FCI is an R code for analyzing data from real-time PCR experiments. This algorithm estimates standard curve features as well as nucleic acid concentrations and confide...
Paolo Verderio, Sara Pizzamiglio, Fabio Gallo, Sim...
CORR
2007
Springer
90views Education» more  CORR 2007»
14 years 9 months ago
Discrete Denoising with Shifts
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
Taesup Moon, Tsachy Weissman
DATE
2005
IEEE
158views Hardware» more  DATE 2005»
15 years 3 months ago
Scheduling of Soft Real-Time Systems for Context-Aware Applications
Context-aware applications pose new challenges, including a need for new computational models, uncertainty management, and efficient optimization under uncertainty. Uncertainty c...
Jennifer L. Wong, Weiping Liao, Fei Li, Lei He, Mi...
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park