Sciweavers

4137 search results - page 732 / 828
» On the number of matchings of a tree
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 10 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
VLDB
2001
ACM
148views Database» more  VLDB 2001»
14 years 9 days ago
Indexing and Querying XML Data for Regular Path Expressions
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...
Quanzhong Li, Bongki Moon
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 7 days ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
GD
1998
Springer
14 years 3 days ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
INFOCOM
1997
IEEE
14 years 2 days ago
Multiwavelength Optical Networks with Limited Wavelength Conversion
— This paper proposes optical wavelength division multiplexed (WDM) networks with limited wavelength conversion that can efficiently support lightpaths (connections) between nod...
Rajiv Ramaswami, Galen H. Sasaki