Sciweavers

198 search results - page 2 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 5 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
FOCS
2009
IEEE
13 years 12 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
ISER
2004
Springer
148views Robotics» more  ISER 2004»
13 years 10 months ago
The Berkeley Lower Extremity Exoskeleton Project
In October 2003, the first functional load-bearing and energetically autonomous exoskeleton, called the Berkeley Lower Extremity Exoskeleton (BLEEX) was demonstrated, walking at th...
H. Kazerooni
MM
2006
ACM
158views Multimedia» more  MM 2006»
13 years 11 months ago
Extreme video retrieval: joint maximization of human and computer performance
We present an efficient system for video search that maximizes the use of human bandwidth, while at the same time exploiting the machine’s ability to learn in real-time from use...
Alexander G. Hauptmann, Wei-Hao Lin, Rong Yan, Jun...
ICDCS
2009
IEEE
14 years 2 months ago
Pushing the Envelope: Extreme Network Coding on the GPU
While it is well known that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its high compu...
Hassan Shojania, Baochun Li