Sciweavers

2194 search results - page 5 / 439
» Improving HLRTA*( k )
Sort
View
DCG
2006
97views more  DCG 2006»
13 years 9 months ago
k-Sets in Four Dimensions
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
Jirí Matousek, Micha Sharir, Shakhar Smorod...
ICALP
2010
Springer
13 years 7 months ago
Metrical Task Systems and the k-Server Problem on HSTs
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
Nikhil Bansal, Niv Buchbinder, Joseph Naor
IPM
2006
104views more  IPM 2006»
13 years 9 months ago
Hierarchical document categorization with k-NN and concept-based thesauri
In this paper, we propose a new algorithm, which incorporates the relationships of concept-based thesauri into the document categorization using the k-NN classifier (k-NN). k-NN i...
Sun Lee Bang, Jae Dong Yang, Hyung Jeong Yang
JGT
2010
152views more  JGT 2010»
13 years 4 months ago
Cycles of even lengths modulo k
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
Ajit A. Diwan
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
13 years 9 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou