Sciweavers

505 search results - page 62 / 101
» Universal Constructions for Large Objects
Sort
View
ICPR
2008
IEEE
16 years 5 months ago
Exploiting qualitative domain knowledge for learning Bayesian network parameters with incomplete data
When a large amount of data are missing, or when multiple hidden nodes exist, learning parameters in Bayesian networks (BNs) becomes extremely difficult. This paper presents a lea...
Qiang Ji, Wenhui Liao
ICML
2007
IEEE
16 years 4 months ago
On learning with dissimilarity functions
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
Liwei Wang, Cheng Yang, Jufu Feng
CISS
2008
IEEE
15 years 10 months ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
ISMVL
2007
IEEE
91views Hardware» more  ISMVL 2007»
15 years 10 months ago
Non-deterministic Multi-valued Matrices for First-Order Logics of Formal Inconsistency
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
Arnon Avron, Anna Zamansky
STACS
2007
Springer
15 years 10 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich