1998 search results - page 346 / 400 » Complexity of the Cover Polynomial |
KAIS
2010
13 years 8 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
MOR
2010
13 years 8 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
SAS
2010
Springer
13 years 8 months ago
2010
Springer
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
SSS
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...