5090 search results - page 102 / 1018 » Constructing Strategies for Programming |
114
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
131
Voted
IMA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
116
Voted
COCOON
1997
Springer
15 years 6 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
118
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which ...
105
Voted
SCAM
2008
IEEE
15 years 9 months ago
2008
IEEE
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...