Sciweavers

5158 search results - page 241 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
EUROCRYPT
2012
Springer
13 years 9 months ago
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
This paper proposes the first inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz...
Tatsuaki Okamoto, Katsuyuki Takashima
ICCV
2003
IEEE
16 years 8 months ago
Controlling Model Complexity in Flow Estimation
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
Zoran Duric, Fayin Li, Harry Wechsler, Vladimir Ch...
CALCO
2009
Springer
115views Mathematics» more  CALCO 2009»
16 years 1 months ago
Relating Coalgebraic Notions of Bisimulation
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
Sam Staton
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
COLT
2007
Springer
16 years 23 days ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret