4377 search results - page 101 / 876 » Mass problems and randomness |
185
click to vote
SPAA
1993
ACM
15 years 9 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
143
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
153
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
169
click to vote
TWC
2008
15 years 5 months ago
2008
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
168
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, It often suffers from the small sample size problem when dealing with t...