1068 search results - page 90 / 214 » Extremely randomized trees |
RSA
2011
13 years 24 days ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
DCC
2005
IEEE
14 years 9 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
ASPDAC
2004
ACM
14 years 3 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
SIBGRAPI
1999
IEEE
14 years 2 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...