159 search results - page 2 / 32 » Weak Equivalences in Psi-Calculi |
COLT
2008
Springer
14 years 19 days ago
2008
Springer
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...
ICCV
2007
IEEE
15 years 24 days ago
2007
IEEE
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...
ICALP
1998
Springer
14 years 3 months ago
1998
Springer
JGO
2011
13 years 5 months ago
2011
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 ...
BIRTHDAY
2005
Springer
14 years 4 months ago
2005
Springer
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...