Sciweavers

496 search results - page 61 / 100
» Generation Gaps Revisited
Sort
View
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
15 years 9 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
IPPS
2008
IEEE
15 years 6 months ago
On synthesizing workloads emulating MPI applications
Evaluation of high performance parallel systems is a delicate issue, due to the difficulty of generating workloads that represent, with fidelity, those that will run on actual sys...
Javier Navaridas, José Miguel-Alonso, Franc...
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
15 years 6 months ago
Estimating functional coverage in bounded model checking
Formal verification is an important issue in circuit and system design. In this context, Bounded Model Checking (BMC) is one of the most successful techniques. But even if all sp...
Daniel Große, Ulrich Kühne, Rolf Drechs...
VLSID
2005
IEEE
120views VLSI» more  VLSID 2005»
15 years 5 months ago
On Finding Consecutive Test Vectors in a Random Sequence for Energy-Aware BIST Design
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
Sheng Zhang, Sharad C. Seth, Bhargab B. Bhattachar...
73
Voted
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 4 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...