6251 search results - page 906 / 1251 » Randomness, Computability, and Density |
215
click to vote
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
We develop a method for learning the spatial statistics of optical flow fields from a novel training database. Training flow fields are constructed using range images of natur...
199
click to vote
SPAA
2005
ACM
16 years 1 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 ...
192
click to vote
CVBIA
2005
Springer
16 years 1 months ago
2005
Springer
In this paper, a novel one-element voxel attribute, namely distance-intensity (DI), is defined for associating spatial information with image intensity for registration tasks. For...
232
click to vote
STACS
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
179
click to vote
GLVLSI
2003
IEEE
16 years 25 days ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...