Sciweavers

1326 search results - page 245 / 266
» Approximate Tree Kernels
Sort
View
EMNLP
2009
15 years 3 months ago
Bilingually-Constrained (Monolingual) Shift-Reduce Parsing
Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
Liang Huang, Wenbin Jiang, Qun Liu
DAM
2011
15 years 10 days ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
IGARSS
2010
15 years 5 days ago
Calibrating probabilities for hyperspectral classification of rock types
This paper investigates the performance of machine learning methods for classifying rock types from hyperspectral data. The main objective is to test the impact on classification ...
Sildomar T. Monteiro, Richard J. Murphy
183
Voted
TCBB
2010
91views more  TCBB 2010»
15 years 2 days ago
SCS: Signal, Context, and Structure Features for Genome-Wide Human Promoter Recognition
This paper integrates the signal, context and structure features for genome-wide promoter recognition, which is critical in many DNA sequence analysis tasks. First, CpG islands ar...
Jia Zeng, Xiaoyu Zhao, Xiao-Qin Cao, Hong Yan
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 9 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi