Sciweavers

1047 search results - page 97 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Self-Blindable Credential Certificates from the Weil Pairing
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
Eric R. Verheul
AAAI
2008
13 years 10 months ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
Jianqiang Shen, Lida Li, Weng-Keen Wong
CORR
2010
Springer
427views Education» more  CORR 2010»
13 years 6 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
CCR
2008
88views more  CCR 2008»
13 years 8 months ago
Rethinking virtual network embedding: substrate support for path splitting and migration
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying re...
Minlan Yu, Yung Yi, Jennifer Rexford, Mung Chiang
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl