2254 search results - page 272 / 451 » Computing the minimal covering set |
276
click to vote
SPAA
2005
ACM
16 years 4 days ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
183
click to vote
SI3D
2005
ACM
16 years 4 days ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
172
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
We describe a method to accurately assess articular cartilage morphology using the three-dimensional laser scanning technology. Traditional methods to obtain ground truth for valid...
177
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
196
click to vote
CCGRID
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...