Sciweavers

1728 search results - page 146 / 346
» Social Computing: Fundamentals and applications
Sort
View
ICPR
2000
IEEE
15 years 11 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
ICCAD
2002
IEEE
189views Hardware» more  ICCAD 2002»
15 years 6 months ago
Reversible logic circuit synthesis
Reversible, or information-lossless, circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requir...
Vivek V. Shende, Aditya K. Prasad, Igor L. Markov,...
IPPS
2000
IEEE
15 years 2 months ago
Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?
For economic reasons, a new trend in the development of distributed hard real-time systems is to rely on the use of CommercialO -The-Shelf cots hardware and operating systems. As...
Pascal Chevochot, Antoine Colin, David Decotigny, ...
CSR
2006
Springer
15 years 1 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere
COORDINATION
2008
Springer
14 years 11 months ago
How to Infer Finite Session Types in a Calculus of Services and Sessions
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
Leonardo Gaetano Mezzina