Sciweavers

4137 search results - page 764 / 828
» On the number of matchings of a tree
Sort
View
ECAI
2000
Springer
14 years 4 days ago
Autosteve: Automated Electrical Design Analysis
AutoSteve performs automated electrical design based on qualitative simulation and functional abstraction. It is the first commercial product capable of performing these tasks for ...
Chris Price
EDBT
2000
ACM
14 years 3 days ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
INFOCOM
1999
IEEE
14 years 2 days ago
MTCP: Scalable TCP-like Congestion Control for Reliable Multicast
We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multim...
Injong Rhee, Nallathambi Balaguru, George N. Rousk...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
14 years 2 days ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
FOCS
1998
IEEE
14 years 1 days ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello