3471 search results - page 650 / 695 » Obstacle Numbers of Graphs |
155
Voted
CLUSTER
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
169
Voted
JCB
2002
15 years 3 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
173
Voted
PAMI
2007
15 years 3 months ago
2007
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...
130
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
140
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...