Sciweavers

1822 search results - page 195 / 365
» The Method of Assigning Incidences
Sort
View
IJCAI
1993
15 years 8 months ago
HYDRA: A Noise-tolerant Relational Concept Learning Algorithm
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...
Kamal M. Ali, Michael J. Pazzani
DAGM
2010
Springer
15 years 8 months ago
Probabilistic Multi-class Scene Flow Segmentation for Traffic Scenes
A multi-class traffic scene segmentation approach based on scene flow data is presented. Opposed to many other approaches using color or texture features, our approach is purely ba...
Alexander Barth, Jan Siegemund, Annemarie Mei&szli...
CGF
2008
131views more  CGF 2008»
15 years 7 months ago
Concurrent Viewing of Multiple Attribute-Specific Subspaces
In this work we present a point classification algorithm for multi-variate data. Our method is based on the concept of attribute subspaces, which are derived from a set of user sp...
Robert Sisneros, C. Ryan Johnson, Jian Huang
JGT
2008
69views more  JGT 2008»
15 years 7 months ago
List colorings with measurable sets
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
Jan Hladký, Daniel Král, Jean-S&eacu...
JSAT
2008
57views more  JSAT 2008»
15 years 7 months ago
tts: A SAT-Solver for Small, Difficult Instances
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
Ivor Spence