2520 search results - page 346 / 504 » The complexity of approximating entropy |
140
click to vote
NIPS
2007
15 years 6 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
143
click to vote
SEBD
2007
15 years 6 months ago
2007
In the last few years, we have been witnessing an evergrowing need for continuous observation and monitoring applications. This need is driven by recent technological advances that...
119
click to vote
AAAI
2000
15 years 6 months ago
2000
Self-organizing models develop realistic cortical structures when given approximations of the visual environment as input, and are an effective way to model the development of fac...
146
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
138
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...