Sciweavers

921 search results - page 12 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
IPPS
1997
IEEE
15 years 3 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
P2P
2009
IEEE
122views Communications» more  P2P 2009»
15 years 6 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
NAR
2011
176views Computer Vision» more  NAR 2011»
14 years 2 months ago
IUPHAR-DB: new receptors and tools for easy searching and visualization of pharmacological data
The IUPHAR database is an established online reference resource for several important classes of human drug targets and related proteins. As well as providing recommended nomencla...
Joanna L. Sharman, Chidochangu P. Mpamhanga, Micha...
LCN
2008
IEEE
15 years 6 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 1 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount