Sciweavers

68 search results - page 4 / 14
» Axiomatization of an exponential similarity function
Sort
View
ICTCS
2007
Springer
14 years 1 months ago
Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions
ing from Prioritized/Weighted Internal Immediate Actions Marco Bernardo and Alessandro Aldini Universit`a di Urbino “Carlo Bo” – Italy Markovian process calculi constitute a ...
Marco Bernardo, Alessandro Aldini
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
14 years 1 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
TAPSOFT
1997
Springer
13 years 11 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
BMCBI
2007
124views more  BMCBI 2007»
13 years 7 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
BMCBI
2006
126views more  BMCBI 2006»
13 years 7 months ago
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data
Background: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heteroge...
Zizhen Yao, Walter L. Ruzzo