Sciweavers

13603 search results - page 411 / 2721
» On the Complexity of Computing Treelength
Sort
View
DIS
2007
Springer
16 years 1 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
PARELEC
2006
IEEE
16 years 1 months ago
Marching Pixels - Using Organic Computing Principles in Embedded Parallel Hardware
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
Marcus Komann, Dietmar Fey
ADBIS
2006
Springer
118views Database» more  ADBIS 2006»
16 years 1 months ago
Computational Database Technology Applied to Option Pricing Via Finite Differences
Computational database technology spans the two research fields data-base technology and scientific computing. It involves development of database capabilities that support compu...
Jöns Åkerlund, Krister Åhlander, ...
ICAC
2005
IEEE
16 years 1 months ago
The Case for Automated Planning in Autonomic Computing
Computing systems have become so complex that the IT industry recognizes the necessity of deliberative methods to make these systems self-configuring, self-healing, selfoptimizin...
Biplav Srivastava, Subbarao Kambhampati
IPPS
2003
IEEE
16 years 27 days ago
Parallelisation of IBD Computation for Determining Genetic Disease Map
A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict ...
Nouhad J. Rizk