Sciweavers

24095 search results - page 4575 / 4819
» Researchers and Development - Young Researches
Sort
View
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
15 years 8 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
COMPGEOM
2005
ACM
15 years 8 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
DIAGRAMS
2006
Springer
15 years 8 months ago
From Diagrams to Models by Analogical Transfer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
Patrick W. Yaner, Ashok K. Goel
DICS
2006
15 years 8 months ago
Dependable Software
Achieving software reliability takes many complementary techniques, directed at the process or at the products. This survey summarizes some of the most fruitful ideas. 1 OVERVIEW ...
Bertrand Meyer
« Prev « First page 4575 / 4819 Last » Next »