Sciweavers

372 search results - page 4 / 75
» On Finding Small 2-Generating Sets
Sort
View
TMM
2010
155views Management» more  TMM 2010»
14 years 4 months ago
Estimating Cohesion in Small Groups Using Audio-Visual Nonverbal Behavior
Abstract--Cohesiveness in teams is an essential part of ensuring the smooth running of task-oriented groups. Research in social psychology and management has shown that good cohesi...
Hayley Hung, Daniel Gatica-Perez
ECML
2007
Springer
15 years 1 months ago
Finding Composite Episodes
Mining frequent patterns is a major topic in data mining research, resulting in many seminal papers and algorithms on item set and episode discovery. The combination of these, call...
Ronnie Bathoorn, Arno Siebes
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
14 years 7 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
14 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»
14 years 9 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