Sciweavers

822 search results - page 15 / 165
» Descendants in Increasing Trees
Sort
View
ASPLOS
2012
ACM
12 years 3 months ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...
JSAC
2011
134views more  JSAC 2011»
13 years 2 months ago
Simple Channel Sensing Order in Cognitive Radio Networks
— In cognitive radio networks (CRNs), effective and efficient channel exploitation is imperative for unlicensed secondary users to seize available network resources and improve ...
Ho Ting Cheng, Weihua Zhuang
ISAAC
2003
Springer
134views Algorithms» more  ISAAC 2003»
14 years 25 days ago
New Ways to Construct Binary Search Trees
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
Travis Gagie
GPEM
2000
103views more  GPEM 2000»
13 years 7 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon
ICIP
1999
IEEE
14 years 9 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...