1629 search results - page 274 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
123
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
COMPSEC
2010
14 years 8 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...