4934 search results - page 816 / 987 » complexity 2008 |
168
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
system during a single processor cycle. But we can abstract out properties of the sequences and focus on the properties of interest. The "specifications" given here are i...
197
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
201
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper offers several contributions for separation of duty (SoD) administration in role-based access control (RBAC) systems. We first introduce a new formal framework, based o...