Sciweavers

8695 search results - page 440 / 1739
» Making the Complex Simple
Sort
View
IPL
2007
100views more  IPL 2007»
15 years 7 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li
TOC
2008
89views more  TOC 2008»
15 years 7 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
TWC
2008
83views more  TWC 2008»
15 years 7 months ago
Opportunistic cooperative diversity with feedback and cheap radios
Practical cooperative diversity protocols often rely on low-cost radios that treat multiple in-band signals as noise and thus require strictly orthogonal transmissions. We analyze ...
Aggelos Bletsas, Ashish Khisti, Moe Z. Win
CG
2004
Springer
15 years 7 months ago
MiniVR: a portable virtual reality system
This paper describes a new virtual reality system designed to be small enough to be totally portable. It is a semiimmersive interaction system based on a movable stereoscopic proj...
Marta Fairén González, Pere Brunet, ...
CORR
1998
Springer
109views Education» more  CORR 1998»
15 years 7 months ago
A Maximum-Entropy Partial Parser for Unrestricted Text
This paper describes a partial parser that assigns syntactic structures to sequences of partof-speech tags. The program uses the maximum entropy parameter estimation method, which...
Wojciech Skut, Thorsten Brants