Sciweavers

2766 search results - page 311 / 554
» Algorithms for trigonometric polynomials
Sort
View
AAAI
2004
15 years 6 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
MP
2008
126views more  MP 2008»
15 years 4 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
16 years 5 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
ALT
2006
Springer
16 years 1 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
FSTTCS
2009
Springer
15 years 11 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya