3145 search results - page 186 / 629 » Algebraic Linear Orderings |
180
click to vote
LICS
2012
IEEE
13 years 7 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
164
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
138
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
158
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
138
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...