Sciweavers

492 search results - page 6 / 99
» The number of possibilities for random dating
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 8 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
FSTTCS
2000
Springer
13 years 11 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
ECSQARU
2005
Springer
14 years 1 months ago
Consonant Random Sets: Structure and Properties
In this paper, we investigate consonant random sets from the point of view of lattice theory. We introduce a new definition of consonancy and study its relationship with possibili...
Enrique Miranda
DSD
2007
IEEE
140views Hardware» more  DSD 2007»
14 years 1 months ago
Pseudo-Random Pattern Generator Design for Column-Matching BIST
This paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design meth...
Petr Fiser
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 2 months ago
Incorporating graceful degradation into embedded system design
In this work, the focus is put on the behavior of a system in case a fault occurs that disables the system from executing its applications. Instead of executing a random subset of...
Michael Glaß, Martin Lukasiewycz, Christian ...