12194 search results - page 354 / 2439 » Numberings Optimal for Learning |
144
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
138
click to vote
VLSID
1998
IEEE
15 years 11 months ago
1998
IEEE
When a Boolean function is transformed by exclusiveOR with a suitably selected transform function, the new functzon is often synthesized wzth significantly reduced hardware. `I�...
173
click to vote
DAC
1994
ACM
1994
ACM
Performance Analysis and Optimization of Schedules for Conditional and Loop-Intensive Specifications
15 years 10 months ago
This paper presents a new method,based on Markov chain analysis, to evaluate the performance of schedules of behavioral specifications. The proposed performance measure is the expe...
188
click to vote
VISSYM
2003
15 years 8 months ago
2003
Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several ...
171
click to vote
TJS
2002
15 years 6 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...