760 search results - page 141 / 152 » Algorithms for finding clique-transversals of graphs |
SMA
2008
ACM
13 years 7 months ago
2008
ACM
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
TIT
2008
13 years 7 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
COMPSEC
2010
13 years 5 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
COLOGNETWENTE
2010
13 years 4 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
COLING
2010
13 years 2 months ago
2010
An important task of opinion mining is to extract people's opinions on features of an entity. For example, the sentence, "I love the GPS function of Motorola Droid"...