Sciweavers

72 search results - page 2 / 15
» What can be efficiently reduced to the Kolmogorov-random str...
Sort
View
CIKM
2005
Springer
13 years 10 months ago
On reducing redundancy and improving efficiency of XML labeling schemes
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
Changqing Li, Tok Wang Ling, Jiaheng Lu, Tian Yu
ICML
2002
IEEE
14 years 6 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
RECOMB
2002
Springer
14 years 5 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
ICARIS
2009
Springer
13 years 9 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
EMNLP
2009
13 years 3 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner