Sciweavers

4047 search results - page 524 / 810
» The Discrete Basis Problem
Sort
View
128
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
Optimal reconstruction might be hard
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
Dominique Attali, André Lieutier
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
15 years 9 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
138
Voted
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 9 months ago
Sequentially updated Probability Collectives
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
Michalis Smyrnakis, David S. Leslie
COMPGEOM
2009
ACM
15 years 9 months ago
The scale axis picture show
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
Joachim Giesen, Balint Miklos, Mark Pauly, Camille...
COCOA
2009
Springer
15 years 9 months ago
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Discovering groups of genes that share common expression profiles is an important problem in DNA microarray analysis. Unfortunately, standard bi-clustering algorithms often fail t...
Yi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans