836 search results - page 78 / 168 » On the Complexity of Train Assignment Problems |
140
click to vote
CLOR
2006
15 years 7 months ago
2006
Abstract. We consider the problem of detecting a large number of different classes of objects in cluttered scenes. We present a learning procedure, based on boosted decision stumps...
136
Voted
CLEF
2010
Springer
15 years 4 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
138
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
125
Voted
PERCOM
2006
ACM
16 years 3 months ago
2006
ACM
Pervasive systems are complex distributed systems containing heterogeneous and mobile devices, services and applications. Policy-based management is an effective approach for mana...
139
click to vote
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...