5115 search results - page 577 / 1023 » On Randomized Lanczos Algorithms |
186
click to vote
ASIAMS
2007
IEEE
16 years 1 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
172
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
166
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper presents a general framework for multi-sensor object recognition through a discriminative probabilistic approach modelling spatial and temporal correlations. The alg...
186
click to vote
PDP
2007
IEEE
16 years 1 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
174
click to vote
ASIAN
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...