Sciweavers

122 search results - page 21 / 25
» Light types for polynomial time computation in lambda-calcul...
Sort
View
IJISEC
2007
61views more  IJISEC 2007»
13 years 7 months ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
14 years 8 days ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
ADHOCNOW
2008
Springer
14 years 1 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
APBC
2007
110views Bioinformatics» more  APBC 2007»
13 years 9 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu
COMPGEOM
2008
ACM
13 years 9 months ago
Polychromatic colorings of plane graphs
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchi...