Sciweavers

7827 search results - page 1566 / 1566
» time 2007
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 4 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
ISCI
2007
141views more  ISCI 2007»
13 years 4 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
« Prev « First page 1566 / 1566 Last » Next »