Sciweavers

4137 search results - page 624 / 828
» On the number of matchings of a tree
Sort
View
VLDB
1999
ACM
131views Database» more  VLDB 1999»
14 years 13 days ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
DEXA
1998
Springer
140views Database» more  DEXA 1998»
14 years 12 days ago
An Analytical Study of Object Identifier Indexing
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
Kjetil Nørvåg, Kjell Bratbergsengen
VISUALIZATION
1997
IEEE
14 years 11 days ago
Multiresolution tetrahedral framework for visualizing regular volume data
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
Yong Zhou, Baoquan Chen, Arie E. Kaufman
VVS
1996
IEEE
129views Visualization» more  VVS 1996»
14 years 10 days ago
Optimal Isosurface Extraction from Irregular Volume Data
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
Paolo Cignoni, Claudio Montani, Enrico Puppo, Robe...
ICCAD
1994
IEEE
114views Hardware» more  ICCAD 1994»
14 years 9 days ago
Performance-driven synthesis of asynchronous controllers
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...