1568 search results - page 108 / 314 » The problem of examination questions in algorithmics |
130
click to vote
ACMSE
2010
ACM
15 years 2 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
152
click to vote
SIGMETRICS
2010
ACM
15 years 9 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
178
click to vote
NIPS
2001
15 years 5 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
129
click to vote
FUN
2010
Springer
15 years 9 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
134
click to vote
ESTIMEDIA
2008
Springer
15 years 6 months ago
2008
Springer
Markov random field models provide a robust formulation of low-level vision problems. Among the problems, stereo vision remains the most investigated field. The belief propagation...