Sciweavers

925 search results - page 76 / 185
» Connectivity on Complete Lattices
Sort
View
ERSA
2007
113views Hardware» more  ERSA 2007»
15 years 7 months ago
Autonomous Computing Systems: A Proof-of-Concept
This paper describes a proof-of-concept implementation of a basic autonomous computing system. The system consists of an XUP Virtex-II Pro board running Linux and a set of softwar...
Neil Steiner, Peter M. Athanas
P2PKM
2004
15 years 7 months ago
Coordinating Mobile Databases
Abstract. We are interested in the development of a database management layer which is completely portable and, therefore, "pluggable" on top of multiple host platforms. ...
Fausto Giunchiglia, Ilya Zaihrayeu
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
15 years 6 months ago
Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
Pierre Leroux
DAM
2002
76views more  DAM 2002»
15 years 6 months ago
Block duplicate graphs and a hierarchy of chordal graphs
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
Martin Charles Golumbic, Uri N. Peled
TOG
2002
127views more  TOG 2002»
15 years 5 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers