1265 search results - page 140 / 253 » Algorithms for Drawing Media |
145
click to vote
ICMLA
2004
15 years 5 months ago
2004
This paper introduces a system, called PolyCluster, which adopts state-of-the-art algorithms for data visualization and integrates human domain knowledge into the construction pro...
101
click to vote
MVA
1992
15 years 5 months ago
1992
This paper describes a method to perform distance measurements inside buildings using a single video camera mounted on a mobile robot. This algorithm is designed specifically to c...
147
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
122
click to vote
ICML
2010
IEEE
15 years 5 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...
118
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Parallel Global Optimization Algorithms (PGOA) provide an efficient way of dealing with hard optimization problems. One method of parallelization of GOAs that is frequently applie...