Sciweavers

5114 search results - page 701 / 1023
» Complex networks
Sort
View
221
Voted
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EUROPAR
2008
Springer
15 years 8 months ago
Mapping Heterogeneous Distributed Applications on Clusters
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Sylvain Jubertie, Emmanuel Melin, Jér&eacut...
JSW
2008
131views more  JSW 2008»
15 years 6 months ago
An Application Directed Adaptive Framework for Autonomic Software
Autonomic computing is gradually becoming accepted as a viable approach to achieving self-management in systems and networks, with the goal of lessening the impact of the complexit...
Bridget Meehan, Girijesh Prasad, T. Martin McGinni...
GIS
2009
ACM
16 years 7 months ago
Map Matching and Uncertainty: an Algorithm and Real-World Experiments
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...
ICML
2002
IEEE
16 years 7 months ago
Exact model averaging with naive Bayesian classifiers
The naive classifier is a well-established mathematical model whose simplicity, speed and accuracy have made it a popular choice for classification in AI and engineering. In this ...
Denver Dash, Gregory F. Cooper