376 search results - page 67 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
TCS
2002
13 years 8 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
AI
2007
Springer
13 years 8 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose a space-time Markov Random Field (MRF)
model to detect abnormal activities in video. The nodes in
the MRF graph correspond to a grid of local regions in the
video fra...
CCA
2009
Springer
14 years 18 days ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...