7742 search results - page 348 / 1549 » The Robustness of Level Sets |
223
click to vote
SWAT
2010
Springer
15 years 12 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
202
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
148
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
In content-driven reputation systems for collaborative content, users gain or lose reputation according to how their contributions fare: authors of long-lived contributions gain r...
202
Voted
CGF
2010
15 years 7 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
177
click to vote
CGF
2008
15 years 7 months ago
2008
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...