4403 search results - page 358 / 881 » Galois Theory of Algorithms |
145
click to vote
TCS
2002
15 years 6 months ago
2002
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
191
click to vote
TMM
2002
15 years 6 months ago
2002
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...
208
click to vote
TVLSI
2002
15 years 6 months ago
2002
: Clock networks account for a significant fraction of the power dissipation of a chip and are critical to performance. This paper presents theory and algorithms for building a low...
203
click to vote
KI
2008
Springer
15 years 5 months ago
2008
Springer
The research aim of this paper is to represent everydaylife patterns of thought like "Because I know, what you think I think ..." by a process on a machine, which is inv...
182
click to vote
JGO
2010
15 years 5 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...