Sciweavers

Share
12 search results - page 1 / 3
» Sophistication Revisited
Sort
View
ICALP
2003
Springer
10 years 2 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
TCS
2010
9 years 4 months ago
Information measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
Luis Filipe Coelho Antunes, Andre Souto
SLP
1994
121views more  SLP 1994»
9 years 10 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
JACM
2006
146views more  JACM 2006»
9 years 9 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
VRST
2010
ACM
9 years 7 months ago
Shake-your-head: revisiting walking-in-place for desktop virtual reality
The Walking-In-Place interaction technique was introduced to navigate infinitely in 3D virtual worlds by walking in place in the real world. The technique has been initially devel...
Léo Terziman, Maud Marchal, Mathieu Emily, ...
books