Sciweavers

1802 search results - page 146 / 361
» Complexity Theory for Operators in Analysis
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
Bo Zhang, Binoy Ravindran

Lecture Notes
404views
17 years 4 months ago
Network Security
A comprehensive treatment of network security. Topics include remote access security, DMZ, firewalls, VPNs, PKI architecture, X.509 Public key infrastructure, web security, S-HTTP,...
Raj Jain
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 10 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
COMPGEOM
2010
ACM
15 years 11 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
AGP
1999
IEEE
15 years 10 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...