1146 search results - page 188 / 230 » Finite cupping sets |
118
click to vote
ADBIS
2010
Springer
15 years 28 days ago
2010
Springer
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
CCCG
2009
15 years 28 days ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
DAGM
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
103
click to vote
ICML
2010
IEEE
15 years 27 days ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...