Sciweavers

107 search results - page 13 / 22
» Computing subsets of equivalence classes for large FSMs
Sort
View
ALT
1995
Springer
13 years 10 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
IMAGING
2001
13 years 8 months ago
A Geometric Foundation of Colorimetry
The physical properties of color are usually described by their spectra, eigenvector expansions or low-dimensional descriptors such as RGB or CIE-Lab. In the first part of the pap...
Reiner Lenz
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 3 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
BMCBI
2008
132views more  BMCBI 2008»
13 years 6 months ago
Very Important Pool (VIP) genes - an application for microarray-based molecular signatures
Background: Advances in DNA microarray technology portend that molecular signatures from which microarray will eventually be used in clinical environments and personalized medicin...
Zhenqiang Su, Huixiao Hong, Hong Fang, Leming M. S...
BMCBI
2007
115views more  BMCBI 2007»
13 years 6 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...