Sciweavers

252 search results - page 35 / 51
» Automata for Data Words and Data Trees
Sort
View
FOCS
2009
IEEE
13 years 11 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
RECOMB
2005
Springer
14 years 8 months ago
Stability of Rearrangement Measures in the Comparison of Genome Sequences
We present data-analytic and statistical tools for studying rates of rearrangement of whole genomes and to assess the stability of these methods with changes in the level of resol...
David Sankoff, Matthew Mazowita
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
14 years 2 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
CONCURRENCY
2008
81views more  CONCURRENCY 2008»
13 years 7 months ago
Resource space view tour mechanism
The Resource Space Model is a new semantic data model for managing various resources. Based on the model, this paper proposes a view mechanism for finding and reusing legacy Resou...
Jin Liu, Xiang Li, Liang Feng
EMNLP
2010
13 years 5 months ago
Effects of Empty Categories on Machine Translation
We examine effects that empty categories have on machine translation. Empty categories are elements in parse trees that lack corresponding overt surface forms (words) such as drop...
Tagyoung Chung, Daniel Gildea