Sciweavers

16504 search results - page 241 / 3301
» New Problems, New Solutions
Sort
View
ECRTS
2004
IEEE
15 years 10 months ago
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
Rodolfo Pellizzoni, Giuseppe Lipari
DSN
2006
IEEE
15 years 10 months ago
Using Attack Injection to Discover New Vulnerabilities
Due to our increasing reliance on computer systems, security incidents and their causes are important problems that need to be addressed. To contribute to this objective, the pape...
Nuno Ferreira Neves, João Antunes, Miguel C...
144
Voted
SPIRE
2000
Springer
15 years 10 months ago
Virtual Test Tubes: A New Methodology for Computing
Biomolecular computing (BMC) aims to capture the innumerable advantages that biological molecules have gained in the course of millions of years of evolution to perform computatio...
Max H. Garzon, Evan Drumwright, Russell J. Deaton,...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 10 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
LREC
2008
89views Education» more  LREC 2008»
15 years 8 months ago
Sign Language Corpus Annotation: toward a new Methodology
This paper deals with non manual gestures annotation involved in Sign Language within the context of automatic generation of Sign Language. We will tackle linguistic researches in...
Emilie Chételat-Pelé, Annelies Braff...