3946 search results - page 284 / 790 » The computational complexity of choice sets |
154
Voted
KDD
2001
ACM
16 years 7 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
204
click to vote
CGF
2010
15 years 4 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
158
click to vote
SI3D
2006
ACM
16 years 21 days ago
2006
ACM
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
204
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...
202
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...