Sciweavers

419 search results - page 53 / 84
» First Order Paths in Ordered Trees
Sort
View
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 10 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
14 years 3 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICNP
1996
IEEE
14 years 2 months ago
A Comparison of Known Classes of Reliable Multicast Protocols
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...
Brian Neil Levine, J. J. Garcia-Luna-Aceves
ICC
2007
IEEE
128views Communications» more  ICC 2007»
14 years 1 months ago
A Near Optimal Localized Heuristic for Voice Multicasting over Ad Hoc Wireless Networks
Abstract-- Providing real-time voice multicasting over multihop ad hoc wireless networks is a challenging task. The unique characteristics of voice traffic (viz. small packet size,...
G. Venkat Raju, Tamma Bheemarjuna Reddy, C. Siva R...
POPL
1991
ACM
14 years 1 months ago
Subtyping Recursive Types
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
Roberto M. Amadio, Luca Cardelli