1431 search results - page 141 / 287 » The complexity of random ordered structures |
175
click to vote
CGF
2000
15 years 3 months ago
2000
In order to populate virtual cities, it is necessary to specify the behaviour of dynamic entities such as pedestrians or car drivers. Since a complete mental model based on vision...
247
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
159
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
115
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
108
click to vote
SODA
2010
ACM
16 years 19 days ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...