Sciweavers

3270 search results - page 31 / 654
» Approximate String Processing
Sort
View
MST
2006
149views more  MST 2006»
13 years 7 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
NIPS
2000
13 years 9 months ago
Text Classification using String Kernels
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences...
Huma Lodhi, John Shawe-Taylor, Nello Cristianini, ...
DAWAK
2009
Springer
14 years 4 months ago
Recommending Multidimensional Queries.
Interactive analysis of datacube, in which a user navigates a cube by launching a sequence of queries is often tedious since the user may have no idea of what the forthcoming query...
Arnaud Giacometti, Elsa Negre, Patrick Marcel
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...