1439 search results - page 250 / 288 » Fast approximation of centrality |
102
Voted
VISUALIZATION
1996
IEEE
15 years 5 months ago
1996
IEEE
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
127
click to vote
VISUALIZATION
1991
IEEE
15 years 4 months ago
1991
IEEE
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
134
Voted
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
101
click to vote
CIC
2004
15 years 2 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
139
Voted
FAST
2004
15 years 2 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...