Sciweavers

2988 search results - page 532 / 598
» Experiments with a New Boosting Algorithm
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
15 years 10 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
SIGCOMM
2009
ACM
15 years 4 months ago
BCube: a high performance, server-centric network architecture for modular data centers
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...
Chuanxiong Guo, Guohan Lu, Dan Li, Haitao Wu, Xuan...
SEMWEB
2005
Springer
15 years 3 months ago
Rapid Benchmarking for Semantic Web Knowledge Base Systems
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...
Sui-Yu Wang, Yuanbo Guo, Abir Qasem, Jeff Heflin
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
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 ...
Pierre Fraigniaud
CIKM
2004
Springer
15 years 3 months ago
Node ranking in labeled directed graphs
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 ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap