Sciweavers

2767 search results - page 271 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 3 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
ICALP
2007
Springer
15 years 9 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi“nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
ICMCS
2006
IEEE
107views Multimedia» more  ICMCS 2006»
15 years 9 months ago
A Flexible Content-Based Approach to Adaptive Image Compression
Recent research in image compression has focused on lossy compression algorithms. However, the baseline implementations of such algorithms generally use a universal quantization p...
Alexander Wong, William Bishop
NIPS
2007
15 years 4 months ago
Regularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
Ke Chen 0001, Shihai Wang
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
15 years 4 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff