Sciweavers

4670 search results - page 330 / 934
» Testing that distributions are close
Sort
View
COLCOM
2005
IEEE
16 years 12 days ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
HPDC
2005
IEEE
16 years 12 days ago
Increasing application performance in virtual environments through run-time inference and adaptation
Virtual machine distributed computing greatly simplifies the use of widespread computing resources by lowering the abstraction, benefiting both resource providers and users. Tow...
Ananth I. Sundararaj, Ashish Gupta, Peter A. Dinda
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
16 years 12 days ago
A Thorough Experimental Study of Datasets for Frequent Itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
Frédéric Flouvat, Fabien De Marchi, ...
ICRA
2005
IEEE
131views Robotics» more  ICRA 2005»
16 years 11 days ago
Model-based Shape Analysis of Gas Concentration Gridmaps for Improved Gas Source Localisation
Abstract— This work addresses the capability to use concentration gridmaps to locate a static gas source. In previous works it was found that depending on the shape of the mapped...
Achim J. Lilienthal, Felix Streichert, Andreas Zel...
SPAA
2005
ACM
16 years 10 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi