3630 search results - page 265 / 726 » Fast Marching Methods |
142
click to vote
IV
1999
IEEE
15 years 10 months ago
1999
IEEE
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware a...
173
click to vote
RT
1998
Springer
15 years 10 months ago
1998
Springer
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
215
click to vote
DMKD
1997
ACM
15 years 10 months ago
1997
ACM
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
141
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
161
click to vote
AAAI
2008
15 years 8 months ago
2008
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...