3946 search results - page 344 / 790 » The computational complexity of choice sets |
186
click to vote
DIS
2001
Springer
15 years 11 months ago
2001
Springer
Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is someth...
150
click to vote
ITICSE
1999
ACM
15 years 11 months ago
1999
ACM
We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation wi...
159
click to vote
SIGGRAPH
1989
ACM
15 years 11 months ago
1989
ACM
As shown in 1982, Julia sets of quadratic functions as well as many other deterministic fractals exist in spaces of higher dimensionality than the complex plane. Originally a boun...
199
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
165
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...