Sciweavers

1282 search results - page 16 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
ACL
2009
13 years 5 months ago
Incremental HMM Alignment for MT System Combination
Inspired by the incremental TER alignment, we re-designed the Indirect HMM (IHMM) alignment, which is one of the best hypothesis alignment methods for conventional MT system combi...
Chi-Ho Li, Xiaodong He, Yupeng Liu, Ning Xi
ALGOSENSORS
2010
Springer
13 years 6 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
ICDM
2007
IEEE
173views Data Mining» more  ICDM 2007»
14 years 1 months ago
Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models
Statistical topic models such as the Latent Dirichlet Allocation (LDA) have emerged as an attractive framework to model, visualize and summarize large document collections in a co...
Ramesh Nallapati, Amr Ahmed, William W. Cohen, Eri...
PPAM
2007
Springer
14 years 1 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling