Sciweavers

1274 search results - page 42 / 255
» New Proofs for
Sort
View
95
Voted
COLT
2005
Springer
15 years 6 months ago
The Value of Agreement, a New Boosting Algorithm
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
Boaz Leskes
AMAST
2000
Springer
15 years 5 months ago
A New Logic for Electronic Commerce Protocols
The primary objective of this paper is to present the deÿnition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It a...
Kamel Adi, Mourad Debbabi, Mohamed Mejri
EJC
2010
15 years 19 days ago
New bijective links on planar maps via orientations
This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures"...
Éric Fusy
TSP
2008
144views more  TSP 2008»
15 years 14 days ago
A New Robust Variable Step-Size NLMS Algorithm
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara...
95
Voted
DCG
1999
93views more  DCG 1999»
15 years 7 days ago
New Maximal Numbers of Equilibria in Bimatrix Games
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
Bernhard von Stengel