Sciweavers

35 search results - page 3 / 7
» Some Applications of the Ultrapower Theorem to the Theory of...
Sort
View
PLILP
1998
Springer
13 years 11 months ago
A Hidden Herbrand Theorem
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
Joseph A. Goguen, Grant Malcolm, Tom Kemp
STACS
2009
Springer
14 years 2 months ago
Randomness on Computable Probability Spaces - A Dynamical Point of View
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
Péter Gács, Mathieu Hoyrup, Cristoba...
AML
2000
101views more  AML 2000»
13 years 7 months ago
Local order property in nonelementary classes
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
Rami P. Grossberg, Olivier Lessmann
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 7 months ago
When is there a representer theorem? Vector versus matrix regularizers
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
FOCS
2004
IEEE
13 years 11 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau