5316 search results - page 116 / 1064 » Which Search Problems Are Random |
147
click to vote
ECCV
1994
Springer
15 years 7 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
111
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly mat...
128
Voted
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states according to their probability of reaching a given...
120
Voted
VTC
2007
IEEE
15 years 9 months ago
2007
IEEE
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
143
Voted
JCO
2010
15 years 1 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...