1816 search results - page 191 / 364 » A New Approach for Solving the Maximum Clique Problem |
176
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
We present a method for spotting words in the wild, i.e., in real images taken in unconstrained environments. Text found in the wild has a surprising range of difficulty. At one en...
192
click to vote
ICC
2007
IEEE
16 years 26 days ago
2007
IEEE
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
143
click to vote
MCS
2007
Springer
16 years 20 days ago
2007
Springer
In this paper we present a new method for fusing classifiers output for problems with a number of classes M > 2. We extend the well-known Behavior Knowledge Space method with a...
179
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
161
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...