Sciweavers

1028 search results - page 48 / 206
» Character sets of strings
Sort
View
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ECML
2007
Springer
14 years 1 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
CORR
2000
Springer
149views Education» more  CORR 2000»
13 years 7 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
ACL
2006
13 years 9 months ago
Using String-Kernels for Learning Semantic Parsers
We present a new approach for mapping natural language sentences to their formal meaning representations using stringkernel-based classifiers. Our system learns these classifiers ...
Rohit J. Kate, Raymond J. Mooney
APAL
2006
64views more  APAL 2006»
13 years 7 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký