Sciweavers

107 search results - page 10 / 22
» Polynomially Bounded Matrix Interpretations
Sort
View
117
Voted
CC
2010
Springer
120views System Software» more  CC 2010»
14 years 9 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
JC
2000
138views more  JC 2000»
15 years 4 days ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 13 days ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
109
Voted
RECOMB
2005
Springer
16 years 20 days ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
SIAMCO
2008
96views more  SIAMCO 2008»
15 years 8 days ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...