1550 search results - page 151 / 310 » Benchmarking for Graph Transformation |
150
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
129
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: With the exponential increase in genomic sequence data there is a need to develop automated approaches to deducing the biological functions of novel sequences with hig...
119
Voted
SAC
2004
ACM
15 years 8 months ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
131
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
147
click to vote
PATAT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...