Sciweavers

13603 search results - page 109 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
CONCURRENCY
2002
116views more  CONCURRENCY 2002»
15 years 5 months ago
Parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale
Dissipative particle dynamics (DPD) and its generalization - fluid particle model (FPM) - represent the "fluid particle" approach for simulating fluid-like behavior in t...
Krzysztof Boryczko, Witold Dzwinel, David A. Yuen
161
Voted
3DPH
2009
145views Healthcare» more  3DPH 2009»
15 years 3 months ago
The Persistent Morse Complex Segmentation of a 3-Manifold
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in ...
Herbert Edelsbrunner, John Harer
JMLR
2010
119views more  JMLR 2010»
15 years 25 days ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
ICMLA
2004
15 years 7 months ago
Reducing complexity of rule based models via meta mining
Complexity, or in other words compactness, of models generated by rule learners is one of often neglected issues, although it has a profound effect on the success of any project t...
Lukasz A. Kurgan
COMPGEOM
2001
ACM
15 years 9 months ago
Hierarchical morse complexes for piecewise linear 2-manifolds
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
Herbert Edelsbrunner, John Harer, Afra Zomorodian