3172 search results - page 603 / 635 » On the Random-Self-Reducibility of Complete Sets |
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
—Internet users such as individuals and organizations are subject to different types of epidemic risks such as worms, viruses, and botnets. To reduce the probability of risk, an ...
118
click to vote
EUROCAST
2007
Springer
15 years 5 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
114
click to vote
ICFP
2007
ACM
15 years 5 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
147
click to vote
BALT
2006
15 years 5 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...