Sciweavers

12825 search results - page 61 / 2565
» Improved PLSOM algorithm
Sort
View
LCN
2003
IEEE
15 years 11 months ago
Improving Multicast Tree Construction in Static Ad Hoc Networks
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
Aleksi Penttinen, Jorma T. Virtamo
GIS
2004
ACM
16 years 7 months ago
A novel improvement to the R*-tree spatial index using gain/loss metrics
The R*-tree is a state-of-the-art spatial index structure. It has already found its way into commercial systems. The most important improvement of the R*-tree over the original R-...
Donghui Zhang, Tian Xia
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 3 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
EDBT
2004
ACM
119views Database» more  EDBT 2004»
16 years 6 months ago
NNH: Improving Performance of Nearest-Neighbor Searches Using Histograms
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
Liang Jin, Nick Koudas, Chen Li
INFOVIS
2003
IEEE
15 years 11 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers