Sciweavers

6506 search results - page 1227 / 1302
» Algorithmic models for sensor networks
Sort
View
ICANN
2003
Springer
15 years 3 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
HCW
1999
IEEE
15 years 2 months ago
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
Ammar H. Alhusaini, Viktor K. Prasanna, Cauligi S....
WWIC
2010
Springer
193views Communications» more  WWIC 2010»
15 years 1 months ago
0day Anomaly Detection Made Possible Thanks to Machine Learning
Abstract. This paper proposes new cognitive algorithms and mechanisms for detecting 0day attacks targeting the Internet and its communication performances and behavior. For this pu...
Philippe Owezarski, Johan Mazel, Yann Labit
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 1 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
« Prev « First page 1227 / 1302 Last » Next »