Sciweavers

3131 search results - page 247 / 627
» Generalized connection caching
Sort
View
LICS
2000
IEEE
15 years 11 months ago
Precongruence Formats for Decorated Trace Preorders
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
ICCAD
1997
IEEE
78views Hardware» more  ICCAD 1997»
15 years 11 months ago
A signature based approach to regularity extraction
Regularity extraction is an important step in the design ow of datapath-dominated circuits. This paper outlines a new method that automatically extracts regular structures from th...
Srinivasa Rao Arikati, Ravi Varadarajan
COMPGEOM
1996
ACM
15 years 10 months ago
Linear Complexity Hexahedral Mesh Generation
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
David Eppstein
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 10 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
DEXA
1993
Springer
121views Database» more  DEXA 1993»
15 years 10 months ago
HyperPATH/O2: Integrating Hypermedia Systems with Object-Oriented Database Systems
We describe an integration of the hypermedia system HyperPATH with the object-oriented DBMS (OODBMS) O¡ . Providing persistence to a hypertext system was the first motivation of...
Bernd Amann, Vassilis Christophides, Michel Scholl