Sciweavers

Share
ICDAR
2011
IEEE
8 years 10 months ago
OCR-Driven Writer Identification and Adaptation in an HMM Handwriting Recognition System
—We present an OCR-driven writer identification algorithm in this paper. Our algorithm learns writer-specific characteristics more precisely from explicit character alignment usi...
Huaigu Cao, Rohit Prasad, Prem Natarajan
PVLDB
2010
112views more  PVLDB 2010»
9 years 9 months ago
Querying Probabilistic Information Extraction
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
ACL
1996
9 years 12 months ago
Parsing Algorithms and Metrics
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algo...
Joshua Goodman
ACL
2000
9 years 12 months ago
A Unified Statistical Model for the Identification of English BaseNP
This paper presents a novel statistical model for automatic identification of English baseNP. It uses two steps: the Nbest Part-Of-Speech (POS) tagging and baseNP identification g...
Endong Xun, Changning Huang, Ming Zhou
ACL
2006
9 years 12 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas
ISPEC
2005
Springer
10 years 4 months ago
A New Class of Codes for Fingerprinting Schemes
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...
Marcel Fernandez, Miguel Soriano, Josep Cotrina Na...
IEEEPACT
2005
IEEE
10 years 4 months ago
Exploiting Coarse-Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor
While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures sin...
Ben Wun, Jeremy Buhler, Patrick Crowley
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
10 years 5 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
ICML
2006
IEEE
10 years 11 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
ICML
2007
IEEE
10 years 11 months ago
CarpeDiem: an algorithm for the fast evaluation of SSL classifiers
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
Roberto Esposito, Daniele P. Radicioni
books