Sciweavers

1573 search results - page 235 / 315
» A Data Structure for Sponsored Search
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 5 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CSB
2003
IEEE
15 years 5 months ago
Initial Large-scale Exploration of Protein-protein Interactions in Human Brain
Study of protein interaction networks is crucial to post-genomic systems biology. Aided by highthroughput screening technologies, biologists are rapidly accumulating protein-prote...
Jake Yue Chen, Andrey Y. Sivachenko, Russell Bell,...
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
15 years 5 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 3 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster