1729 search results - page 287 / 346 » Bound Graph Polysemy |
148
click to vote
COMGEO
2011
ACM
14 years 12 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
175
Voted
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
190
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
149
click to vote
IJCV
2012
13 years 7 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...
163
Voted
DIALM
2003
ACM
15 years 10 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...