75 search results - page 7 / 15 » Finding small balanced separators |
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
To better represent human interactions in social networks, the authors take a network-oriented simulation approach to analyze the evolution of acquaintance networks based on local...
71
Voted
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
CHI
2004
ACM
15 years 9 months ago
2004
ACM
We describe a study that investigated how a shared interactive tabletop (DiamondTouch) can be designed to provide new opportunities for supporting collaborative decision-making. S...
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...