Sciweavers

1136 search results - page 50 / 228
» Finding Small Holes
Sort
View
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 9 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 8 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
HPCA
2001
IEEE
14 years 9 months ago
JETTY: Filtering Snoops for Reduced Energy Consumption in SMP Servers
We propose methods for reducing the energy consumed by snoop requests in snoopy bus-based symmetric multiprocessor (SMP) systems. Observing that a large fraction of snoops do not ...
Andreas Moshovos, Gokhan Memik, Babak Falsafi, Alo...
GROUP
2007
ACM
14 years 28 days ago
Searching for experts in the enterprise: combining text and social network analysis
Employees depend on other people in the enterprise for rapid access to important information. But current systems for finding experts do not adequately address the social implicat...
Kate Ehrlich, Ching-Yung Lin, Vicky Griffiths-Fish...
LREC
2010
139views Education» more  LREC 2010»
13 years 10 months ago
Automatically Identifying Changes in the Semantic Orientation of Words
The meanings of words are not fixed but in fact undergo change, with new word senses arising and established senses taking on new aspects of meaning or falling out of usage. Two t...
Paul Cook, Suzanne Stevenson