1055 search results - page 131 / 211 » Enumerations in computable structure theory |
STOC
2005
ACM
14 years 10 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
CSCW
2010
ACM
14 years 5 months ago
2010
ACM
This paper builds on earlier CSCW studies of domestic technologies, looking at the frequent maintenance required by new security technologies that households are adopting to provi...
WIA
2009
Springer
14 years 4 months ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant p...