Sciweavers

9842 search results - page 212 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
GPEM
2008
128views more  GPEM 2008»
15 years 18 days ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
131
Voted
DRM
2006
Springer
15 years 4 months ago
The problem with rights expression languages
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
Pramod A. Jamkhedkar, Gregory L. Heileman, Iv&aacu...

Publication
338views
13 years 10 months ago
A Reference Discretization Strategy for the Numerical Solution of Physical Field Problems.
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi

Publication
519views
13 years 10 months ago
The Finite Volume, Finite Difference, and Finite Elements Methods as Numerical Methods for Physical Field Problems
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi
102
Voted
ESANN
2006
15 years 1 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