5592 search results - page 308 / 1119 » On Random Betweenness Constraints |
167
click to vote
PE
2007
Springer
15 years 6 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
177
click to vote
JMLR
2010
15 years 1 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, ...
202
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
205
click to vote
ICDAR
2011
IEEE
14 years 6 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...
163
click to vote
RSCTC
2004
Springer
15 years 12 months ago
2004
Springer
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...