Sciweavers

9405 search results - page 1536 / 1881
» Computing a Model of Set Theory
Sort
View
174
Voted
ATAL
2006
Springer
15 years 10 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
233
Voted
CVPR
2009
IEEE
17 years 1 months ago
Optimization of Landmark Selection for Cortical Surface Registration
Manually labeled landmark sets are often required as in- puts for landmark-based image registration. Identifying an optimal subset of landmarks from a training dataset may be us...
Anand A. Joshi, David W. Shattuck, Dimitrios Panta...
CVPR
2008
IEEE
16 years 8 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
DATE
2009
IEEE
159views Hardware» more  DATE 2009»
16 years 1 months ago
Design and implementation of a database filter for BLAST acceleration
— BLAST is a very popular Computational Biology algorithm. Since it is computationally expensive it is a natural target for acceleration research, and many reconfigurable archite...
Panagiotis Afratis, Constantinos Galanakis, Euripi...
204
Voted
BMCBI
2006
161views more  BMCBI 2006»
15 years 6 months ago
A novel approach to phylogenetic tree construction using stochastic optimization and clustering
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
Ling Qin, Yixin Chen, Yi Pan, Ling Chen
« Prev « First page 1536 / 1881 Last » Next »