1485 search results - page 67 / 297 » connection 2010 |
92
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
112
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
We present a robust approach to creating 2.5D building models from aerial LiDAR point clouds. The method is guaranteed to produce crack-free models composed of complex roofs and ve...
89
Voted
PAKDD
2010
ACM
15 years 5 months ago
2010
ACM
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
95
Voted
ICML
2010
IEEE
15 years 1 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...
106
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Deep Belief Networks (DBNs) are hierarchical generative models which have been used successfully to model high dimensional visual data. However, they are not robust to common vari...