2223 search results - page 279 / 445 » Ontological Framework for Approximation |
124
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
130
click to vote
NIPS
2001
15 years 6 months ago
2001
Mutual information is widely used, in a descriptive way, to measure the stochastic dependence of categorical random variables. In order to address questions such as the reliabilit...
132
click to vote
AAAI
1994
15 years 6 months ago
1994
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
161
Voted
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
379
click to vote
ICA
2012
Springer
14 years 15 days ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...