Sciweavers

638 search results - page 66 / 128
» Efficient algorithms for evaluating xpath over streams
Sort
View
ESANN
2008
13 years 10 months ago
Parallelizing single patch pass clustering
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Nikolai Alex, Barbara Hammer
PE
2002
Springer
124views Optimization» more  PE 2002»
13 years 8 months ago
Continuous-time hidden Markov models for network performance evaluation
In this paper, we study the use of continuous-time hidden Markov models (CT-HMMs) for network protocol and application performance evaluation. We develop an algorithm to infer the...
Wei Wei, Bing Wang, Donald F. Towsley
PVLDB
2008
110views more  PVLDB 2008»
13 years 8 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
CIKM
2008
Springer
13 years 10 months ago
Peer-to-peer similarity search over widely distributed document collections
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...
Christos Doulkeridis, Kjetil Nørvåg, ...
AFRIGRAPH
2009
ACM
14 years 22 days ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage