Sciweavers

616 search results - page 57 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 7 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
STACS
2001
Springer
14 years 3 days ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
ICDCN
2009
Springer
14 years 8 days ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
ICIP
2004
IEEE
14 years 9 months ago
Fast alignment of digital images using a lower bound on an entropy metric
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
Mert R. Sabuncu, Peter J. Ramadge
ACL
2012
11 years 10 months ago
Akamon: An Open Source Toolkit for Tree/Forest-Based Statistical Machine Translation
We describe Akamon, an open source toolkit for tree and forest-based statistical machine translation (Liu et al., 2006; Mi et al., 2008; Mi and Huang, 2008). Akamon implements all...
Xianchao Wu, Takuya Matsuzaki, Jun-ichi Tsujii