Sciweavers

169 search results - page 6 / 34
» The Tree of Hubs Location Problem
Sort
View
98
Voted
COMPSAC
2002
IEEE
15 years 4 months ago
Achieving Scalability in Hierarchical Location Services
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
Maarten van Steen, Gerco Ballintijn
82
Voted
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 5 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
ADBIS
2004
Springer
147views Database» more  ADBIS 2004»
15 years 5 months ago
A Hybrid Keyword Search across Peer-to-Peer Federated Databases
The need for Keyword search in databases is suggested both by Web integration with legacy database management system and by dynamic Web publication. However, it sacrifices the inh...
Jungkee Kim, Geoffrey Fox
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
15 years 5 months ago
Discriminative Discovery of Transcription Factor Binding Sites from Location Data
Motivation: The availability of genome-wide location analyses based on chromatin immunoprecipitation (ChIP) data gives a new insight for in silico analysis of transcriptional regu...
Yuji Kawada, Yasubumi Sakakibara
105
Voted
FOCS
2000
IEEE
15 years 4 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount