Sciweavers

8413 search results - page 311 / 1683
» Ordering Problem Subgoals
Sort
View
ESANN
2006
15 years 8 months ago
Synthesis of maximum margin and multiview learning using unlabeled data
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
Sándor Szedmák, John Shawe-Taylor
IJCAI
1989
15 years 7 months ago
Temporal Matching: Recognizing Dynamic Situations from Discrete Measurements
The converse problem of measurement interpretation is event recognition. In situations which are characterized by a specific order of events, a single snapshot is not sufficient t...
Klaus Nökel
CORR
2008
Springer
109views Education» more  CORR 2008»
15 years 6 months ago
New Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Arist Kojevnikov, Sergey I. Nikolenko
EJC
2010
15 years 6 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
JUCS
2007
99views more  JUCS 2007»
15 years 6 months ago
Spectral Densest Subgraph and Independence Number of a Graph
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
Reid Andersen, Sebastian M. Cioaba