Sciweavers

877 search results - page 15 / 176
» Full Abstraction for HOPLA
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
AFRICACRYPT
2010
Springer
14 years 2 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...