5115 search results - page 428 / 1023 » On Randomized Lanczos Algorithms |
224
click to vote
BVAI
2005
Springer
16 years 1 months ago
2005
Springer
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
205
Voted
KI
1999
Springer
15 years 12 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
174
click to vote
RANDOM
1999
Springer
15 years 12 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
182
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
220
Voted
STOC
1992
ACM
15 years 11 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...