Sciweavers

3270 search results - page 101 / 654
» Approximate String Processing
Sort
View
ACL
1990
13 years 11 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir
CORR
1999
Springer
107views Education» more  CORR 1999»
13 years 9 months ago
WebScript - A Scripting Language for the Web
WebScript is a scripting language for processing Web documents. Designed as an extension to Jacl, the Java implementation of Tcl, WebScript allows programmers to manipulate HTML i...
Yin Zhang
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 5 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 10 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
IPSN
2009
Springer
14 years 4 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...