2403 search results - page 50 / 481 » Optimal Randomized RANSAC |
117
click to vote
FTDCS
2004
IEEE
15 years 3 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
101
click to vote
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Cooperative relaying has recently been recognized as an alternative to MIMO in a typical multi cellular environment. Inserting random delays at the non-regenerative fixed rela...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
97
Voted
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
121
click to vote
ICDAR
2011
IEEE
13 years 11 months ago
2011
IEEE
— This paper describes a Markov random field (MRF) model with weighting parameters optimized by conditional random field (CRF) for on-line recognition of handwritten Japanese cha...