Sciweavers

246 search results - page 45 / 50
» Calibrating Random Forests
Sort
View
ECCV
2008
Springer
14 years 10 months ago
Segmentation and Recognition Using Structure from Motion Point Clouds
We propose an algorithm for semantic segmentation based on 3D point clouds derived from ego-motion. We motivate five simple cues designed to model specific patterns of motion and 3...
Gabriel J. Brostow, Jamie Shotton, Julien Fauqueur...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CIDM
2009
IEEE
14 years 3 months ago
Ensemble member selection using multi-objective optimization
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
Tuve Löfström, Ulf Johansson, Henrik Bos...
ICSM
2008
IEEE
14 years 3 months ago
Understanding the rationale for updating a function's comment
Up-to-date comments are critical for the successful evolution of a software application. When modifying a function, developers may update the comment associated with the function ...
Haroon Malik, Istehad Chowdhury, Hsiao-Ming Tsou, ...
DCOSS
2006
Springer
14 years 9 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...