Sciweavers

2593 search results - page 139 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
CP
2007
Springer
15 years 9 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
IPPS
2010
IEEE
15 years 3 months ago
Improving the performance of Uintah: A large-scale adaptive meshing computational framework
Abstract--Uintah is a highly parallel and adaptive multiphysics framework created by the Center for Simulation of Accidental Fires and Explosions in Utah. Uintah, which is built up...
Justin Luitjens, Martin Berzins
NECO
1998
119views more  NECO 1998»
15 years 4 months ago
Density Estimation by Mixture Models with Smoothing Priors
In the statistical approach for self-organizing maps (SOMs), learning is regarded as an estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior on the ce...
Akio Utsugi
175
Voted
PRL
2011
14 years 8 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
ICAPR
2009
Springer
15 years 11 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri