Sciweavers

1485 search results - page 67 / 297
» connection 2010
Sort
View
STACS
2010
Springer
14 years 6 months ago
Construction Sequences and Certifying 3-Connectedness
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...
Jens M. Schmidt
ECCV
2010
Springer
14 years 4 months ago
2.5D Dual Contouring: A Robust Approach to Creating Building Models from Aerial LiDAR Point Clouds
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...
Qian-Yi Zhou, Ulrich Neumann
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
14 years 4 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
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 ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
ICML
2010
IEEE
14 years 8 days ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
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...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
ICML
2010
IEEE
14 years 8 days ago
Deep networks for robust visual recognition
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...
Yichuan Tang, Chris Eliasmith