Sciweavers

2767 search results - page 47 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 2 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
COCO
1998
Springer
103views Algorithms» more  COCO 1998»
15 years 2 months ago
Nonrelativizing Separations
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
Harry Buhrman, Lance Fortnow, Thomas Thierauf
ICIP
1997
IEEE
15 years 11 months ago
Zerotree Design for Image Compression: Toward Weighted Universal Zerotree Coding
Weconsidertheproblem of optimal, data-dependentzerotree designfor use in weighted universal zerotree codes for image compression.A weighted universalzerotree code (WUZC) is a data...
Michelle Effros
DCC
2005
IEEE
15 years 9 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ICALT
2005
IEEE
15 years 3 months ago
Predicting Students' Marks in Hellenic Open University
The ability to provide assistance for a student at the appropriate level is invaluable in the learning process. Not only does it aid the student’s learning process but also prev...
Sotiris B. Kotsiantis, Panayiotis E. Pintelas