1493 search results - page 161 / 299 » Local resilience of graphs |
PLDI
2000
ACM
14 years 12 days ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
SIAMDM
2000
13 years 7 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
TIP
2010
13 years 6 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...