451 search results - page 8 / 91 » Relationless Completeness and Separations |
103
click to vote
ICDM
2010
IEEE
14 years 12 months ago
2010
IEEE
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
129
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
134
click to vote
JSA
2000
15 years 1 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
130
click to vote
ALT
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
114
click to vote
ALT
2001
Springer
15 years 11 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...