388 search results - page 58 / 78 » An approximate algorithm for median graph computation using ... |
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
SYNASC
2006
IEEE
14 years 1 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
TAMC
2010
Springer
14 years 26 days ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
IJCV
2012
11 years 10 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...