Sciweavers

1017 search results - page 138 / 204
» A General Model for Authenticated Data Structures
Sort
View
122
Voted
HPDC
2007
IEEE
15 years 6 months ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann
150
Voted
APN
1992
Springer
15 years 6 months ago
Towards a Modular Analysis of Coloured Petri Nets
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
Søren Christensen, Laure Petrucci
126
Voted
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
15 years 12 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
123
Voted
ROMAN
2007
IEEE
127views Robotics» more  ROMAN 2007»
15 years 9 months ago
Incremental on-line hierarchical clustering of whole body motion patterns
Abstract— This paper describes a novel algorithm for autonomous and incremental learning of motion pattern primitives by observation of human motion. Human motion patterns are ed...
Dana Kulic, Wataru Takano, Yoshihiko Nakamura
128
Voted
ISSTA
2010
ACM
15 years 4 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...