Sciweavers

247 search results - page 49 / 50
» Efficient similarity search for market basket data
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 7 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
IJDSN
2006
143views more  IJDSN 2006»
13 years 7 months ago
MicroRouting: A Scalable and Robust Communication Paradigm for Sparse Ad Hoc Networks
Mobile ad hoc networks are self-organizing networks that provide rapid network connectivity in infrastructureless environments. Most routing protocols designed for MANETs assume c...
Saumitra M. Das, Himabindu Pucha, Y. Charlie Hu
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 11 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
TC
2002
13 years 6 months ago
UCFS-A Novel User-Space, High Performance, Customized File System for Web Proxy Servers
Web proxy caching servers play a key role in today's Web infrastructure. Previous studies have shown that disk I/O is one of the major performance bottlenecks of proxy server...
Jun Wang, Rui Min, Yingwu Zhu, Yiming Hu
AIPS
2010
13 years 7 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger