Sciweavers

334 search results - page 29 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 8 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 10 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
INFOCOM
2010
IEEE
13 years 6 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 8 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
ICRA
2009
IEEE
218views Robotics» more  ICRA 2009»
13 years 6 months ago
Automatically and efficiently inferring the hierarchical structure of visual maps
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
Margarita Chli, Andrew J. Davison