31 search results - page 4 / 7 » A faster implementation of the Goemans-Williamson clustering... |
PG
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper describes a two pass algorithm capable of computing solutions to the global illumination in general environments (diffuse or glossy surfaces, anisotropically scattering...
IAT
2006
IEEE
13 years 11 months ago
2006
IEEE
Data mining can be used to model crime detection problems. Crimes are a social nuisance and cost our society dearly in several ways. Any research that can help in solving crimes f...
SC
2003
ACM
13 years 10 months ago
2003
ACM
This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and gene...
CGF
2008
13 years 5 months ago
2008
We present a new method for rapidly computing shadows from semi-transparent objects like hair. Our deep opacity maps method extends the concept of opacity shadow maps by using a d...
IPPS
1996
IEEE
13 years 9 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...