Sciweavers

3374 search results - page 530 / 675
» Explaining Similarity of Terms
Sort
View
JALC
2007
109views more  JALC 2007»
15 years 3 months ago
A Family of NFAs Free of State Reductions
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
JAPLL
2007
88views more  JAPLL 2007»
15 years 3 months ago
Some comments on history based structures
History based models, introduced by Parikh and Ramanujam, provide a natural mathematical model of social interactive situations. These models offer a ”low level” description ...
Eric Pacuit
BMCBI
2005
114views more  BMCBI 2005»
15 years 3 months ago
AutoFACT: An Automatic Functional Annotation and Classification Tool
Background: Assignment of function to new molecular sequence data is an essential step in genomics projects. The usual process involves similarity searches of a given sequence aga...
Liisa B. Koski, Michael W. Gray, B. Franz Lang, Ge...
TKDE
2008
234views more  TKDE 2008»
15 years 3 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
JMLR
2007
101views more  JMLR 2007»
15 years 3 months ago
Noise Tolerant Variants of the Perceptron Algorithm
A large number of variants of the Perceptron algorithm have been proposed and partially evaluated in recent work. One type of algorithm aims for noise tolerance by replacing the l...
Roni Khardon, Gabriel Wachman