836 search results - page 163 / 168 » On the Complexity of Train Assignment Problems |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
109
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we propose a new method to construct an edge-preserving filter which has very similar response to the bilateral filter. The bilateral filter is a normalized convolu...
PAM
2010
Springer
15 years 4 months ago
2010
Springer
The ability to pinpoint the geographic location of IP hosts is compelling for applications such as on-line advertising and network attack diagnosis. While prior methods can accurat...
ROBOCUP
2009
Springer
15 years 4 months ago
2009
Springer
As the reach of multiagent reinforcement learning extends to more and more complex tasks, it is likely that the diverse challenges posed by some of these tasks can only be address...
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...