1066 search results - page 116 / 214 » Computing Private Set Operations with Linear Complexities |
EUROGRAPHICS
2010
Eurographics
15 years 5 months ago
2010
Eurographics
n this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. T...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
SIAMJO
2008
14 years 9 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
VLSM
2005
Springer
15 years 3 months ago
2005
Springer
Current state-of-the-art methods in variational image segmentation using level set methods are able to robustly segment complex textured images in an unsupervised manner. In recent...
HPDC
1995
IEEE
15 years 1 months ago
1995
IEEE
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...