Sciweavers

3775 search results - page 196 / 755
» The Expression Problem Revisited
Sort
View
HPCC
2010
Springer
15 years 4 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
151
Voted
CADE
2012
Springer
13 years 6 months ago
SPARQL Query Containment under RDFS Entailment Regime
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
Melisachew Wudage Chekol, Jérôme Euze...
111
Voted
NIPS
2001
15 years 5 months ago
A kernel method for multi-labelled classification
This article presents a Support Vector Machine (SVM) like learning system to handle multi-label problems. Such problems are usually decomposed into many two-class problems but the...
André Elisseeff, Jason Weston
EXPCS
2007
15 years 7 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne
PAMI
2011
14 years 11 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih