Sciweavers

12373 search results - page 2363 / 2475
» Semi-Logarithmic Number Systems
Sort
View
TISSEC
2008
202views more  TISSEC 2008»
13 years 9 months ago
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
compromised sensor nodes. The framework provides an appropriate abstraction of applicationspecific detection mechanisms and models the unique properties of sensor networks. Based o...
Qing Zhang, Ting Yu, Peng Ning
TISSEC
2008
106views more  TISSEC 2008»
13 years 9 months ago
On predictive models and user-drawn graphical passwords
In commonplace text-based password schemes, users typically choose passwords that are easy to recall, exhibit patterns, and are thus vulnerable to brute-force dictionary attacks. ...
Paul C. van Oorschot, Julie Thorpe
TIT
2008
86views more  TIT 2008»
13 years 9 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
TIT
2008
87views more  TIT 2008»
13 years 9 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga
JAIR
2007
141views more  JAIR 2007»
13 years 9 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
« Prev « First page 2363 / 2475 Last » Next »