836 search results - page 58 / 168 » On the Complexity of Train Assignment Problems |
109
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
150
Voted
CVPR
2010
IEEE
16 years 7 days ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
131
click to vote
DOA
2000
15 years 5 months ago
2000
In the world of pervasive computing where large management systems, as well as small devices, all become interconnected, the problem of the configuration and management of network...
136
click to vote
ESWA
2008
15 years 3 months ago
2008
In this paper a novel complex classifier architecture is proposed. The architecture has a hierarchical tree-like structure with simple artificial neural networks (ANNs) at each no...
125
click to vote
ACL
2011
14 years 7 months ago
2011
Resolving coordination ambiguity is a classic hard problem. This paper looks at coordination disambiguation in complex noun phrases (NPs). Parsers trained on the Penn Treebank are...