Sciweavers

21 search results - page 3 / 5
» Empirical Methods for Compound Splitting
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
ICPR
2010
IEEE
14 years 24 days ago
On the Scalability of Evidence Accumulation Clustering
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
André Lourenço, Ana Luisa Nobre Fred, Anil Jain
WSC
2004
13 years 8 months ago
Permuted Weighted Area Estimators
Calvin and Nakayama previously introduced permuting as a way of improving existing standardized time series methods. The basic idea is to split a simulated sample path into nonove...
James M. Calvin, Marvin K. Nakayama
WSC
1998
13 years 8 months ago
A Comparison of RESTART Implementations
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain...
Marnix J. J. Garvels, Dirk P. Kroese
BMCBI
2010
103views more  BMCBI 2010»
13 years 7 months ago
MTRAP: Pairwise sequence alignment algorithm by a new measure based on transition probability between two consecutive pairs of r
Background: Sequence alignment is one of the most important techniques to analyze biological systems. It is also true that the alignment is not complete and we have to develop it ...
Toshihide Hara, Keiko Sato, Masanori Ohya