2095 search results - page 160 / 419 » Improved pebbling bounds |
180
click to vote
ICC
2008
IEEE
16 years 28 days ago
2008
IEEE
—In this paper the performance of unslotted ALOHA and CSMA are analyzed in spatially distributed wireless networks. Users/packets arrive randomly in space and time according to a...
189
click to vote
ICDCS
2008
IEEE
16 years 28 days ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
149
click to vote
COLT
2007
Springer
16 years 20 days ago
2007
Springer
Recently, Balcan and Blum [1] suggested a theory of learning based on general similarity functions, instead of positive semi-definite kernels. We study the gap between the learnin...
151
click to vote
CTRSA
2007
Springer
16 years 20 days ago
2007
Springer
We mathematically explore a model for the shortness and security for passwords that are stored in hashed form. The model is implicitly in the NIST publication [8] and is based on c...
157
click to vote
FORMATS
2007
Springer
16 years 20 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...