Sciweavers

2137 search results - page 144 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ATAL
2005
Springer
15 years 3 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
ICCV
2003
IEEE
16 years 2 days ago
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
Marshall F. Tappen, William T. Freeman
BMCBI
2010
144views more  BMCBI 2010»
14 years 10 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
15 years 7 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
ECSQARU
2005
Springer
15 years 3 months ago
Default Clustering from Sparse Data Sets
Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clusterin...
Julien Velcin, Jean-Gabriel Ganascia