Sciweavers

266 search results - page 23 / 54
» On the variance of random polygons
Sort
View
CPC
1999
105views more  CPC 1999»
14 years 11 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill
ESANN
2006
15 years 1 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
ICC
2000
IEEE
15 years 4 months ago
Synchronizability of General Periodic Pattern Signals
— In this paper1 an optimum and sub-optimum maximum likelihood (ML) rule for joint frame and carrier frequency offset estimation are derived, which rely on the transmission of a...
Branimir Stantchev, Gerhard Fettweis
GIS
2010
ACM
14 years 10 months ago
Investigation of aggregation effects in vegetation condition monitoring at a national scale
Monitoring vegetation condition is an important issue in the Mediterranean region, in terms of both securing food and preventing fires. Vegetation indices (VIs), mathematical tran...
T. K. Alexandridis, T. Katagis, I. Z. Gitas, N. G....
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 17 hour ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry