4377 search results - page 83 / 876 » Mass problems and randomness |
135
click to vote
ICANN
2009
Springer
16 years 1 months ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
140
Voted
ICDT
2007
ACM
16 years 27 days ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
163
click to vote
ICB
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a random network ensemble for face recognition problem, particularly for images with a large appearance variation and with a limited number of training se...
162
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
200
click to vote
DAM
2006
15 years 6 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...