Sciweavers

1380 search results - page 122 / 276
» A General Polynomial Sieve
Sort
View
CORR
2007
Springer
194views Education» more  CORR 2007»
13 years 10 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
ITA
2007
101views Communications» more  ITA 2007»
13 years 10 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
TCS
2010
13 years 4 months ago
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
PODS
2011
ACM
220views Database» more  PODS 2011»
13 years 28 days ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
13 years 27 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown