Sciweavers

4123 search results - page 511 / 825
» Multiple Relational Embedding
Sort
View
219
Voted
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
15 years 10 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
CIKM
1994
Springer
15 years 10 months ago
Intelligent Caching: Selecting, Representing, and Reusing Data in an Information Server
Accessing information sources to retrieve data requested by a user can be expensive, especially when dealing with distributed information sources. One way to reduce this cost is t...
Yigal Arens, Craig A. Knoblock
PARLE
1992
15 years 10 months ago
Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
Robert Marek, Erhard Rahm
CSE
2009
IEEE
15 years 10 months ago
Reliable Identities Using Off-the-Shelf Hardware Security in MANETs
Application scenarios for mobile ad-hoc networks (MANETs) impose a variety of non-standard security requirements. furthermore, in many scenarios owner and user of devices do not a...
Nicolai Kuntze, Andreas Fuchs, Carsten Rudolph
CAV
2010
Springer
198views Hardware» more  CAV 2010»
15 years 10 months ago
Termination Analysis with Compositional Transition Invariants
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...