Sciweavers

353 search results - page 57 / 71
» Dynamic programming alignment accuracy
Sort
View
AUSAI
2004
Springer
14 years 1 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
ICDAR
2003
IEEE
14 years 28 days ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton
CC
2001
Springer
146views System Software» more  CC 2001»
14 years 4 days ago
Alias Analysis by Means of a Model Checker
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
Vincenzo Martena, Pierluigi San Pietro
EMNLP
2008
13 years 9 months ago
Sparse Multi-Scale Grammars for Discriminative Latent Variable Parsing
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
Slav Petrov, Dan Klein
JCC
2008
92views more  JCC 2008»
13 years 7 months ago
Fast procedure for reconstruction of full-atom protein models from reduced representations
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
Piotr Rotkiewicz, Jeffrey Skolnick