Sciweavers

159 search results - page 2 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
COLT
2008
Springer
13 years 8 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
ICCV
2007
IEEE
14 years 8 months ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley
JGO
2011
116views more  JGO 2011»
13 years 1 months ago
On generalized Ekeland's variational principle and equivalent formulations for set-valued mappings
We propose a very weak type of generalized distance called weak τ-function and use it to weaken the assumptions about lower semicontinuity in existing formulations of Ekeland’s ...
Phan Quoc Khanh, D. N. Quy
BIRTHDAY
2005
Springer
13 years 11 months ago
A Characterisation of Weak Bisimulation Congruence
This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of s...
Rob J. van Glabbeek