Sciweavers

1139 search results - page 174 / 228
» Bounded Ideation Theory
Sort
View
CCS
2006
ACM
13 years 11 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...
DCOSS
2006
Springer
13 years 11 months ago
Evaluating Local Contributions to Global Performance in Wireless Sensor and Actuator Networks
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
Christopher J. Rozell, Don H. Johnson
EWCBR
2006
Springer
13 years 11 months ago
Unsupervised Feature Selection for Text Data
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
Nirmalie Wiratunga, Robert Lothian, Stewart Massie
FSE
2006
Springer
116views Cryptology» more  FSE 2006»
13 years 11 months ago
On Feistel Structures Using a Diffusion Switching Mechanism
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large ...
Taizo Shirai, Kyoji Shibutani
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...