836 search results - page 66 / 168 » On the Complexity of Train Assignment Problems |
151
click to vote
NIPS
2004
15 years 5 months ago
2004
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
133
click to vote
ACSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
128
Voted
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a max-margin formulation for the multi-label classification problem where the goal is to tag a data point with a set of pre-specified labels. Given a set of L labels, a...
153
click to vote
ICPADS
1998
IEEE
15 years 8 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
151
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We address the problem of visual category recognition by learning an image-to-image distance function that attempts to satisfy the following property: the distance between images ...