6365 search results - page 1075 / 1273 » Fast Local Computation Algorithms |
146
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
166
click to vote
IJCSA
2007
15 years 6 months ago
2007
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...
197
click to vote
TCSV
2008
15 years 6 months ago
2008
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
169
click to vote
CGF
2005
15 years 6 months ago
2005
The point set is a flexible surface representation suitable for both geometry processing and real-time rendering. In most applications, the control of the point cloud density is c...
170
click to vote
CGF
1998
15 years 6 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...