2988 search results - page 532 / 598 » Experiments with a New Boosting Algorithm |
132
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
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...
154
Voted
SIGCOMM
2009
ACM
15 years 9 months ago
2009
ACM
This paper presents BCube, a new network architecture specifically designed for shipping-container based, modular data centers. At the core of the BCube architecture is its serve...
134
Voted
SEMWEB
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a method for rapid development of benchmarks for Semantic Web knowledge base systems. At the core, we have a synthetic data generation approach for OWL that is...
140
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
120
Voted
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...