Sciweavers

3020 search results - page 165 / 604
» Optimal partition trees
Sort
View
BIBE
2006
IEEE
119views Bioinformatics» more  BIBE 2006»
16 years 18 days ago
Large Grain Size Stochastic Optimization Alignment
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
Perry Ridge, Hyrum Carroll, Dan Sneddon, Mark J. C...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
PDPTA
2003
15 years 7 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan
TSP
2010
15 years 1 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
ICPR
2006
IEEE
16 years 7 months ago
Initialization Techniques for Segmentation with the Chan-Vese Model
This paper introduces an effective initialization approach for segmentation using the Chan-Vese model. The initial curve is found by searching among the extremals of the fidelity ...
Jan Erik Solem, Niels Chr. Overgaard, Anders Heyde...