15033 search results - page 63 / 3007 » Complexity Theory and Algorithms |
150
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
119
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
118
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
133
Voted
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
126
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...