1068 search results - page 98 / 214 » Extremely randomized trees |
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract—Existing approaches to P2P streaming can be divided into two general classes: (i) tree-based approaches use pushbased content delivery over multiple tree-shaped overlays...
DAC
1989
ACM
14 years 2 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
CAV
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...