Sciweavers

1068 search results - page 77 / 214
» Extremely randomized trees
Sort
View
ICPR
2010
IEEE
14 years 2 months ago
Fast and Spatially-Smooth Terrain Classification Using Monocular Camera
In this paper, we present a monocular camera based terrain classification scheme. The uniqueness of the proposed scheme is that it inherently incorporates spatial smoothness while...
Chetan Jakkoju, Madhava Krishna, C. V. Jawahar
COMPGEOM
1997
ACM
14 years 2 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 4 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
CPC
1998
154views more  CPC 1998»
13 years 9 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson