Sciweavers

7065 search results - page 1350 / 1413
» Iterative Scheduling Algorithms
Sort
View
JMLR
2006
169views more  JMLR 2006»
13 years 10 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
IJHPCA
2007
114views more  IJHPCA 2007»
13 years 10 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
TCSV
2008
177views more  TCSV 2008»
13 years 10 months ago
An ICA Mixture Hidden Markov Model for Video Content Analysis
In this paper, a new theoretical framework based on hidden Markov model (HMM) and independent component analysis (ICA) mixture model is presented for content analysis of video, nam...
Jian Zhou, Xiao-Ping Zhang
JCB
2007
146views more  JCB 2007»
13 years 10 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
BMCBI
2002
131views more  BMCBI 2002»
13 years 9 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
« Prev « First page 1350 / 1413 Last » Next »