13457 search results - page 118 / 2692 » Can we elect if we cannot compare |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We compare static arbitrage price bounds on basket calls, i.e. bounds that only involve buy-and-hold trading strategies, with the price range obtained within a multivariate genera...
JMLR
2012
11 years 11 months ago
2012
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
DAGM
2007
Springer
14 years 3 months ago
2007
Springer
Typical tracking algorithms exploit temporal coherence, in the sense of expecting only small object motions. Even without exact knowledge of the scene, additional spatial coherence...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
CONCUR
1997
Springer
14 years 1 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...