Sciweavers

49 search results - page 3 / 10
» A note on the substructural hierarchy
Sort
View
DAM
2002
76views more  DAM 2002»
13 years 5 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
ISLPED
1997
ACM
114views Hardware» more  ISLPED 1997»
13 years 10 months ago
Analysis of power consumption in memory hierarchies
In this paper, we note and analyze a key trade-off: as the complexity of caches increases (higher set-associativity, larger block size, and larger overall size), the power consume...
Patrick Hicks, Matthew Walnock, Robert Michael Owe...
KI
1992
Springer
13 years 10 months ago
How to Construct a Logic for Your Application
Abstract. The purpose of this note is to present and evaluate the options available to a researcher wishing to use logic for representation, reasoning and computation in his applic...
Dov M. Gabbay
MSCS
2006
97views more  MSCS 2006»
13 years 5 months ago
An extremely sharp phase transition threshold for the slow growing hierarchy
We investigate natural systems of fundamental sequences for ordinals below the Howard Bachmann ordinal and study growth rates of the resulting slow growing hierarchies. We consider...
Andreas Weiermann
VLDB
1994
ACM
114views Database» more  VLDB 1994»
13 years 10 months ago
On Index Selection Schemes for Nested Object Hierarchies
In this paper we address the problem of devising a set of indexes for a nested object hierarchy in an object-oriented database to improve the overall system performance. It is not...
Sudarshan S. Chawathe, Ming-Syan Chen, Philip S. Y...