Sciweavers

696 search results - page 125 / 140
» A class of combinatorial identities
Sort
View
ALT
2006
Springer
15 years 8 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ALT
2005
Springer
15 years 8 months ago
Learning Multiple Languages in Groups
We consider a variant of Gold’s learning paradigm where a learner receives as input n different languages (in form of one text where all input languages are interleaved). Our g...
Sanjay Jain, Efim B. Kinber
INFOCOM
2009
IEEE
15 years 6 months ago
Graceful Network Operations
—A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational...
Saqib Raza, Yuanchen Zhu, Chen-Nee Chuah
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
15 years 6 months ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...
FOCS
2008
IEEE
15 years 6 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow