Sciweavers

344 search results - page 65 / 69
» Some Theorems We Should Prove
Sort
View
ALT
1999
Springer
13 years 11 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
ACNS
2008
Springer
138views Cryptology» more  ACNS 2008»
14 years 1 months ago
Traceable and Retrievable Identity-Based Encryption
Abstract. Very recently, the concept of Traceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption scheme) was introduced in Crypto 2007. ...
Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susil...
ECAI
2010
Springer
13 years 7 months ago
On the stability of an Optimal Coalition Structure
The two main questions in coalition games are 1) what coalitions should form and 2) how to distribute the value of each coalition between its members. When a game is not superaddit...
Stéphane Airiau, Sandip Sen
ALMOB
2008
81views more  ALMOB 2008»
13 years 7 months ago
Stability of multiple alignments and phylogenetic trees: an analysis of ABC-transporter proteins family
Background: Sequence-based phylogeny reconstruction is a fundamental task in Bioinformatics. Practically all methods for phylogeny reconstruction are based on multiple alignments....
Holger Wagner, Burkhard Morgenstern, Andreas W. M....
SIGECOM
2005
ACM
120views ECommerce» more  SIGECOM 2005»
14 years 26 days ago
Optimal design of English auctions with discrete bid levels
In this paper we consider a common form of the English auction that is widely used in online Internet auctions. This discrete bid auction requires that the bidders may only submit...
Esther David, Alex Rogers, Jeremy Schiff, Sarit Kr...