Sciweavers

27 search results - page 2 / 6
» Why Computational Complexity Requires Stricter Martingales
Sort
View
ECBS
1996
IEEE
93views Hardware» more  ECBS 1996»
13 years 9 months ago
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
Gérard Le Lann
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
14 years 5 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
CHI
2009
ACM
13 years 8 months ago
I just don't know why it's gone: maintaining informal information use in inpatient care
We conducted a field-based study examining informal nursing information. We examined the use of this information before and after the adoption of a CPOE (Computerized Provider Ord...
Xiaomu Zhou, Mark S. Ackerman, Kai Zheng
MFCS
1995
Springer
13 years 8 months ago
Measure on P: Robustness of the Notion
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
Eric Allender, Martin Strauss
ASC
2011
13 years 10 days ago
Evolutionary cepstral coefficients
Evolutionary algorithms provide flexibility and robustness required to find satisfactory solutions in complex search spaces. This is why they are successfully applied for solvin...
Leandro Daniel Vignolo, Hugo Leonardo Rufiner, Die...