4926 search results - page 97 / 986 » Two Graph Algorithms On an Associative Computing Model |
114
click to vote
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
Flash crowds and high concentrations of users in wireless LANs (WLANs) cause significant interference problems and unsustainable load at access points. This leads to poor connect...
132
click to vote
WICON
2008
15 years 3 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
105
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
113
click to vote
PAMI
1998
15 years 2 months ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
117
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...