724 search results - page 21 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
IV
1999
IEEE
15 years 4 months ago
1999
IEEE
The aim of occlusion culling is to cull away a significant amount of invisible primitives at different viewpoints. We present two algorithms to improve occlusion culling for a hig...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
: In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a se...
105
click to vote
TWC
2010
14 years 6 months ago
2010
In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. T...
MOBIHOC
2010
ACM
14 years 9 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
SIAMJO
2000
14 years 11 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...