903 search results - page 132 / 181 » Non-well-founded trees in categories |
126
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
123
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
142
click to vote
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
146
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
143
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...