Sciweavers

2152 search results - page 75 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
ITSL
2008
15 years 1 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
ALMOB
2006
109views more  ALMOB 2006»
14 years 12 months ago
A novel functional module detection algorithm for protein-protein interaction networks
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
CVPR
2004
IEEE
16 years 1 months ago
From Fragments to Salient Closed Boundaries: An In-Depth Study
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....
Song Wang, Jun Wang, Toshiro Kubota
PROCEDIA
2010
113views more  PROCEDIA 2010»
14 years 10 months ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
JMLR
2010
163views more  JMLR 2010»
14 years 6 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray