Sciweavers

1558 search results - page 171 / 312
» Scalable work stealing
Sort
View
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
15 years 3 months ago
The InfoSleuth Project
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
Roberto J. Bayardo Jr., William Bohrer, Richard S....
CIKM
2009
Springer
15 years 3 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
CIKM
2008
Springer
15 years 1 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
CIKM
2006
Springer
15 years 1 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
NETWORKING
2008
15 years 19 days ago
Designing Optimal iBGP Route-Reflection Topologies
The Border Gateway Protocol (BGP) is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In l...
Marc-Olivier Buob, Steve Uhlig, Mickael Meulle