Sciweavers

807 search results - page 146 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
KAIS
2008
114views more  KAIS 2008»
13 years 8 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
JSAC
2006
109views more  JSAC 2006»
13 years 8 months ago
Polarized MIMO channels in 3-D: models, measurements and mutual information
4G systems are expected to support data rates of the order of 100 Mbps in the outdoor environment and 1 Gbps in the indoor/stationary environment. In order to support such large p...
Mansoor Shafi, Min Zhang, Aris L. Moustakas, Peter...
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 8 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 8 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
CN
2008
117views more  CN 2008»
13 years 8 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...