6568 search results - page 317 / 1314 » Reducing the Complexity of Reductions |
200
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
206
click to vote
TSP
2008
15 years 6 months ago
2008
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
148
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
179
click to vote
COMPSEC
2010
15 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...
179
click to vote
EGC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this article we consider objects for which we have a matrix of dissimilarities and we are interested in their links with covariates. We focus on state sequences for wh...