Sciweavers

Share
14979 search results - page 1 / 2996
» Two Problems for Sophistication
Sort
View
ALT
2015
Springer
4 years 3 months ago
Two Problems for Sophistication
Kolmogorov complexity measures the amount of information in data, but does not distinguish structure from noise. Kolmogorov’s definition of the structure function was the firs...
Peter Bloem, Steven de Rooij, Pieter Adriaans
ICALP
2003
Springer
10 years 1 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
INFOCOM
2008
IEEE
10 years 2 months ago
Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks
—The design of computer and communication systems has been based, for decades, on the fundamental assumption that the objective of all users is to improve their own performance. ...
Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy
FOCS
2006
IEEE
10 years 2 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
EWHCI
1993
10 years 16 hour ago
The MSM Framework: A Design Space for Multi-Sensori-Motor Systems
One of the new design goals in Human Computer Interaction is to extend the sensory-motor capabilities of computer systems to better match the natural communication means of human b...
Joëlle Coutaz, Laurence Nigay, Daniel Salber
books