1920 search results - page 320 / 384 » The Complexity of the A B C Problem |
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
ICIP
2005
IEEE
14 years 2 months ago
2005
IEEE
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
MTV
2005
IEEE
14 years 2 months ago
2005
IEEE
The increasing complexity and size of system level design models introduces a difficult challenge for validating them. Hence, in most industries, design validation takes a large p...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
SC
2004
ACM
14 years 2 months ago
2004
ACM
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...