Sciweavers

720 search results - page 110 / 144
» Linear k-arboricities on trees
Sort
View
EMNLP
2009
13 years 9 months ago
K-Best Combination of Syntactic Parsers
In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previo...
Hui Zhang, Min Zhang, Chew Lim Tan, Haizhou Li
FPGA
2009
ACM
168views FPGA» more  FPGA 2009»
13 years 9 months ago
Large-scale wire-speed packet classification on FPGAs
Multi-field packet classification is a key enabling function of a variety of network applications, such as firewall processing, Quality of Service differentiation, traffic billing...
Weirong Jiang, Viktor K. Prasanna
JAIR
2011
123views more  JAIR 2011»
13 years 6 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
ACL
2012
12 years 1 months ago
Large-Scale Syntactic Language Modeling with Treelets
We propose a simple generative, syntactic language model that conditions on overlapping windows of tree context (or treelets) in the same way that n-gram language models condition...
Adam Pauls, Dan Klein
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
15 years 15 days ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling