Sciweavers

675 search results - page 23 / 135
» Biased Range Trees
Sort
View
72
Voted
ML
2000
ACM
14 years 10 months ago
Enlarging the Margins in Perceptron Decision Trees
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
Kristin P. Bennett, Nello Cristianini, John Shawe-...
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
15 years 5 months ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
96
Voted
CPC
2008
135views more  CPC 2008»
14 years 11 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
77
Voted
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
15 years 5 months ago
Analysis and optimization of NBTI induced clock skew in gated clock trees
NBTI (Negative Bias Temperature Instability) has emerged as the dominant PMOS device failure mechanism for sub100nm VLSI designs. There is little research to quantify its impact o...
Ashutosh Chakraborty, Gokul Ganesan, Anand Rajaram...
73
Voted
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 5 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson