Sciweavers

860 search results - page 150 / 172
» Biased Random Walks
Sort
View
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
14 years 3 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
INFOCOM
2002
IEEE
14 years 2 months ago
Adaptive Load Sharing for Network Processors
—A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by ...
Lukas Kencl, Jean-Yves Le Boudec
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 2 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
EDBT
2009
ACM
131views Database» more  EDBT 2009»
14 years 1 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
AAAI
2007
14 years 5 days ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...