Sciweavers

4378 search results - page 574 / 876
» On the Complexity of Ordered Colourings
Sort
View
RTA
2005
Springer
16 years 6 days ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
SAMOS
2005
Springer
16 years 6 days ago
Modeling NoC Architectures by Means of Deterministic and Stochastic Petri Nets
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Chi...
Holger Blume, Thorsten von Sydow, Daniel Becker, T...
SCALESPACE
2005
Springer
16 years 6 days ago
Discontinuity-Preserving Computation of Variational Optic Flow in Real-Time
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
Andrés Bruhn, Joachim Weickert, Timo Kohlbe...
SEMWEB
2005
Springer
16 years 6 days ago
Bootstrapping Ontology Alignment Methods with APFEL
Abstract. Ontology alignment is a prerequisite in order to allow for interoperation between different ontologies and many alignment strategies have been proposed to facilitate the ...
Marc Ehrig, Steffen Staab, York Sure
VLDB
2005
ACM
118views Database» more  VLDB 2005»
16 years 6 days ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng