Sciweavers

1110 search results - page 160 / 222
» Clustering with the Connectivity Kernel
Sort
View
87
Voted
ICML
2010
IEEE
15 years 1 months ago
Distance dependent Chinese restaurant processes
We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for nonexchangeability. This class can be used to...
David M. Blei, Peter Frazier
100
Voted
AHSWN
2008
92views more  AHSWN 2008»
15 years 21 days ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
107
Voted
CGF
2010
169views more  CGF 2010»
15 years 20 days ago
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
Alexandru Telea, Ozan Ersoy
114
Voted
COR
2010
146views more  COR 2010»
15 years 20 days ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
118
Voted

Publication
203views
15 years 20 days ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...