Sciweavers

7930 search results - page 1291 / 1586
» Greedy in Approximation Algorithms
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 9 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
FPL
2001
Springer
96views Hardware» more  FPL 2001»
15 years 9 months ago
System Level Tools for DSP in FPGAs
Abstract. Visual data ow environments are ideally suited for modeling digital signal processing (DSP) systems, as many DSP algorithms are most naturally speci ed by signal ow gra...
James Hwang, Brent Milne, Nabeel Shirazi, Jeffrey ...
DCC
2000
IEEE
15 years 9 months ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel
FOCS
2000
IEEE
15 years 9 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
PG
2000
IEEE
15 years 9 months ago
Morphing Using Curves and Shape Interpolation Techniques
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
Henry Johan, Yuichi Koiso, Tomoyuki Nishita
« Prev « First page 1291 / 1586 Last » Next »