Sciweavers

404 search results - page 33 / 81
» LogP: Towards a Realistic Model of Parallel Computation
Sort
View
CIKM
2004
Springer
14 years 2 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
CGI
2003
IEEE
14 years 2 months ago
Virtualizing Real-World Objects
High quality, virtual 3D models are quickly emerging as a new multimedia data type with applications in such diverse areas as e-commerce, online encyclopaedias, or virtual museums...
Hendrik P. A. Lensch, Jan Kautz, Michael Goesele, ...
EUROPAR
2007
Springer
14 years 3 months ago
A First Step Towards Automatically Building Network Representations
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...
Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quins...
SMILE
1998
Springer
14 years 1 months ago
Automatic 3D Model Construction for Turn-Table Sequences
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
Andrew W. Fitzgibbon, Geoffrey Cross, Andrew Zisse...
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 1 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran