Sciweavers

277 search results - page 18 / 56
» From Reversible to Irreversible Computations
Sort
View
DIS
2008
Springer
13 years 10 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
ECCV
1996
Springer
14 years 10 months ago
Euclidean Reconstruction: From Paraperspective to Perspective
In this paper we describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in or...
Stéphane Christy, Radu Horaud
DAC
1995
ACM
14 years 6 hour ago
Automatic Clock Abstraction from Sequential Circuits
Our goal is to transform a low-level circuit design into a more representation. A pre-existing tool, Tranalyze [4], takes a switch-level circuit and generates a functionally equiv...
Samir Jain, Randal E. Bryant, Alok Jain
RAID
2010
Springer
13 years 6 months ago
Inferring Protocol State Machine from Real-World Trace
Application-level protocol specifications are helpful for network security management, including intrusion detection, intrusion prevention and detecting malicious code. However, c...
Yipeng Wang, Zhibin Zhang, Li Guo
RECOMB
2007
Springer
14 years 8 months ago
Multi-break Rearrangements: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
Max A. Alekseyev