4463 search results - page 315 / 893 » computing 2000 |
148
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
180
click to vote
ECCV
2000
Springer
15 years 10 months ago
2000
Springer
The critical configurations for projective reconstruction from three views are discussed. A set of cameras and points is said to be critical if the projected image points are insu...
200
click to vote
EDOC
2000
IEEE
15 years 11 months ago
2000
IEEE
Due to its high protocol overhead, both in data traffic and in round-trips, Java RMI is poorly suited for communication over slow wireless links. However, its performance can be ...
154
click to vote
HPDC
2000
IEEE
15 years 11 months ago
2000
IEEE
Federated distributed systems present new challenges to resource management, which cannot be met by conventional systems that employ relatively static resource models and centrali...
172
click to vote
HPDC
2000
IEEE
15 years 11 months ago
2000
IEEE
The unprecedented scale, heterogeneity, and varied usage patterns of grids pose significant technical challenges to any underlying file system that will support them. While grid...