Sciweavers

516 search results - page 38 / 104
» Sets of k-Independent Strings
Sort
View
JACM
2007
132views more  JACM 2007»
13 years 7 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
COLT
1992
Springer
13 years 11 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
TKDE
2008
111views more  TKDE 2008»
13 years 7 months ago
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
Sanghamitra Bandyopadhyay, Sriparna Saha
NAACL
2010
13 years 5 months ago
Integrating Joint n-gram Features into a Discriminative Training Framework
Phonetic string transduction problems, such as letter-to-phoneme conversion and name transliteration, have recently received much attention in the NLP community. In the past few y...
Sittichai Jiampojamarn, Colin Cherry, Grzegorz Kon...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken