Sciweavers

2252 search results - page 48 / 451
» Improving Random Forests
Sort
View
CVPR
2010
IEEE
1135views Computer Vision» more  CVPR 2010»
14 years 3 months ago
Towards Weakly Supervised Semantic Segmentation by Means of Multiple Instance and Multitask Learning.
We address the task of learning a semantic segmentation from weakly supervised data. Our aim is to devise a system that predicts an object label for each pixel by making use of on...
Alexander Vezhnevets, Joachim Buhmann
APLAS
2006
ACM
13 years 11 months ago
A Localized Tracing Scheme Applied to Garbage Collection
We present a method to visit all nodes in a forest of data structures while taking into account object placement. We call the technique a Localized Tracing Scheme as it improves lo...
Yannis Chicha, Stephen M. Watt
CEC
2008
IEEE
14 years 2 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
CVPR
2010
IEEE
14 years 4 months ago
Segmenting Video Into Classes of Algorithm-Suitability
Given a set of algorithms, which one(s) should you apply to, i) compute optical flow, or ii) perform feature matching? Would looking at the sequence in question help you decide? I...
Oisin Mac Aodha, Gabriel Brostow, marc Pollefeys