Sciweavers

4324 search results - page 269 / 865
» A Generalized Representer Theorem
Sort
View

Publication
101views
14 years 11 days ago
On the degree and half-degree principle for symmetric polynomials
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
Cordian Riener
BMCBI
2002
131views more  BMCBI 2002»
15 years 6 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
AAAI
2012
13 years 9 months ago
Optimal Auctions for Spiteful Bidders
Designing revenue-optimal auctions for various settings is perhaps the most important, yet sometimes most elusive, problem in mechanism design. Spiteful bidders have been intensel...
Pingzhong Tang, Tuomas Sandholm
RECOMB
2003
Springer
16 years 7 months ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...