1996 search results - page 216 / 400 » Financial Theory 2 |
172
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
184
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We propose a natural, mathematically tractable model of TCP which captures both its additive-increase, multiplicative-decrease behavior and its feedback mechanism. Neither a fluid...
174
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
167
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...