87 search results - page 8 / 18 » Bounds for the generalized repetition threshold |
65
Voted
EJC
2006
14 years 9 months ago
2006
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
78
Voted
KDD
2001
ACM
15 years 10 months ago
2001
ACM
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
The importance of testing approaches that exploit error tolerance to improve yield has previously been established. Error rate, defined as the percentage of vectors for which the...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically,...
76
Voted
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper the performance of unslotted ALOHA and CSMA are analyzed in spatially distributed wireless networks. Users/packets arrive randomly in space and time according to a...