Sciweavers

1632 search results - page 138 / 327
» On special numberings of hypergraphs
Sort
View
EUROCRYPT
2005
Springer
16 years 18 days ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
16 years 18 days ago
An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Pete...
ICN
2005
Springer
16 years 17 days ago
Optimizing Inter-domain Multicast Through DINloop with GMPLS
This paper proposes DINloop (Data-In-Network loop) based multicast with GMPLS (generalized multiprotocol label switching) to overcome the scalability problems existing in current i...
Huaqun Guo, Lek Heng Ngoh, Wai-Choong Wong
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 17 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
NOSSDAV
2005
Springer
16 years 17 days ago
The case for multi-tier camera sensor networks
In this position paper, we examine recent technology trends that have resulted in a broad spectrum of camera sensors, wireless radio technologies, and embedded sensor platforms wi...
Purushottam Kulkarni, Deepak Ganesan, Prashant J. ...