19 search results - page 2 / 4 » Large Topological Cliques in Graphs Without a 4-Cycle |
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
ESAS
2006
Springer
13 years 10 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
ECCV
2002
Springer
14 years 8 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
ICRA
2005
IEEE
14 years 13 days ago
2005
IEEE
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
INFOCOM
2012
IEEE
11 years 9 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...