Sciweavers

234 search results - page 29 / 47
» An Introduction to Binary Search Trees and Balanced Trees
Sort
View
PPSN
2000
Springer
15 years 1 months ago
Genetic Programming Bloat without Semantics
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
William B. Langdon, Wolfgang Banzhaf
CVPR
1998
IEEE
15 years 11 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
INFOCOM
2000
IEEE
15 years 2 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
WISEC
2010
ACM
14 years 7 months ago
Preventing multi-query attack in location-based services
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
Nilothpal Talukder, Sheikh Iqbal Ahamed
IPPS
2007
IEEE
15 years 3 months ago
Dynamic Load Balancing of Unbalanced Computations Using Message Passing
This paper examines MPI’s ability to support continuous, dynamic load balancing for unbalanced parallel applications. We use an unbalanced tree search benchmark (UTS) to compare...
James Dinan, Stephen Olivier, Gerald Sabin, Jan Pr...