Sciweavers

1731 search results - page 206 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
13 years 11 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
GEOINFORMATICA
2007
223views more  GEOINFORMATICA 2007»
13 years 8 months ago
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...
Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Ya...
IBPRIA
2007
Springer
14 years 2 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
AIME
2007
Springer
14 years 2 days ago
Using Temporal Context-Specific Independence Information in the Exploratory Analysis of Disease Processes
Abstract. Disease processes in patients are temporal in nature and involve uncertainty. It is necessary to gain insight into these processes when aiming at improving the diagnosis,...
Stefan Visscher, Peter J. F. Lucas, Ildikó ...
DCOSS
2005
Springer
14 years 1 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das