Sciweavers

913 search results - page 11 / 183
» Full Abstraction for Linda
Sort
View
LOPSTR
2009
Springer
14 years 2 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
14 years 1 months ago
Scaffolding on-line segmentation of full body human motion patterns
Abstract— This paper develops an approach for on-line segmentation of whole body human motion patterns during human motion observation and learning. A Hidden Markov Model is used...
Dana Kulic, Yoshihiko Nakamura
ICADL
2005
Springer
108views Education» more  ICADL 2005»
14 years 1 months ago
Harvesting for Full-Text Retrieval
Abstract. We propose an approach to Distributed Information Retrieval based on the periodic and incremental centralisation of full-text indices of widely dispersed and autonomously...
Fabio Simeoni, Murat Yakici, Steve Neely, Fabio Cr...
SAT
2004
Springer
115views Hardware» more  SAT 2004»
14 years 25 days ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad
FSE
2006
Springer
114views Cryptology» more  FSE 2006»
13 years 11 months ago
Cryptanalysis of the Full HAVAL with 4 and 5 Passes
Abstract. HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992. It has three variants, 3-, 4-, and 5-pass HAVAL. Previou...
Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park