3946 search results - page 711 / 790 » The computational complexity of choice sets |
216
click to vote
SPAA
1997
ACM
15 years 10 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
167
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
225
click to vote
GRAPHITE
2007
ACM
15 years 10 months ago
2007
ACM
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...
181
click to vote
ASPLOS
2008
ACM
15 years 8 months ago
2008
ACM
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
203
click to vote
AICT
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...