524 search results - page 96 / 105 » On the Maximum Number of Cliques in a Graph |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
ENVSOFT
2006
13 years 7 months ago
2006
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...