Sciweavers

502 search results - page 87 / 101
» Streaming Random Forests
Sort
View
ICISS
2009
Springer
15 years 11 months ago
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowled...
Michael K. Reiter, Vyas Sekar, Chad Spensky, Zheng...
ISW
2009
Springer
15 years 11 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
ISCAS
2008
IEEE
100views Hardware» more  ISCAS 2008»
15 years 11 months ago
On the security of a class of image encryption schemes
— Recently four chaos-based image encryption schemes were proposed. Essentially, the four schemes can be classified into one class, which is composed of two basic parts: permuta...
Chengqing Li, Guanrong Chen
INFOCOM
2007
IEEE
15 years 10 months ago
Small Active Counters
— The need for efficient counter architecture has arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications requir...
Rade Stanojevic
154
Voted
IROS
2007
IEEE
162views Robotics» more  IROS 2007»
15 years 10 months ago
Genetic MRF model optimization for real-time victim detection in search and rescue
— One primary goal in rescue robotics is to deploy a team of robots for coordinated victim search after a disaster. This requires robots to perform subtasks, such as victim detec...
Alexander Kleiner, Rainer Kümmerle