4913 search results - page 263 / 983 » Results and Perspectives of the G |
214
Voted
ADHOCNOW
2004
Springer
16 years 3 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
164
click to vote
CAI
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies colimits of sequences of finite Chu spaces and their ramifications. We consider three base categories of Chu spaces: the generic Chu spaces (C), the extensional ...
160
click to vote
ECCC
2006
15 years 6 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
169
click to vote
JC
2008
15 years 6 months ago
2008
For two subsets W and V of a normed space X. The relative Kolmogorov n-width of W relative to V in X is defined by Kn(W, V )X := inf Ln sup f W inf gV Ln f - g X, where the infimu...
189
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...