Sciweavers

252 search results - page 23 / 51
» Automata for Data Words and Data Trees
Sort
View
JMLR
2008
148views more  JMLR 2008»
15 years 5 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
JORS
2010
149views more  JORS 2010»
15 years 18 days ago
Modelling LGD for unsecured personal loans: decision tree approach
The Basel New Accord which is being implemented throughout the banking world on 1 January 2007 has made a significant difference to the use of modelling within financial organisat...
Ania Matuszyk, C. Mues, Lyn C. Thomas
IS
2011
15 years 24 days ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
SIGIR
2004
ACM
15 years 11 months ago
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
Shuang Liu, Fang Liu, Clement T. Yu, Weiyi Meng
BMCBI
2008
128views more  BMCBI 2008»
15 years 6 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich