Sciweavers

3663 search results - page 80 / 733
» Problems in the ontology of computer programs
Sort
View
JMLR
2006
125views more  JMLR 2006»
13 years 8 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
JMLR
2006
145views more  JMLR 2006»
13 years 8 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
ACMICEC
2006
ACM
191views ECommerce» more  ACMICEC 2006»
14 years 2 months ago
An ontology of trust: formal semantics and transitivity
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
Jingwei Huang, Mark S. Fox
BMCBI
2008
163views more  BMCBI 2008»
13 years 9 months ago
i-SEGOPubmed: a web interface for semantic enabled browsing of PubMed using Gene Ontology
imately 20 million abstracts. Browsing such a huge repository to find relevant information as well as providing elearning service requires new generation of interfaces. Methods suc...
Mohammed Yeasin, Bhanu Vanteru, Jahangheer S. Shai...
ICPP
2008
IEEE
14 years 3 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...