Sciweavers

45 search results - page 6 / 9
» Introduction to Turing categories
Sort
View
ECCC
2002
68views more  ECCC 2002»
14 years 10 months ago
Bi-Immunity Separates Strong NP-Completeness Notions
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
Aduri Pavan, Alan L. Selman
CCS
2009
ACM
15 years 1 months ago
Filter-resistant code injection on ARM
Code injections attacks are one of the most powerful and important classes of attacks on software. In such attacks, the attacker sends malicious input to a software application, w...
Yves Younan, Pieter Philippaerts, Frank Piessens, ...
ATAL
2009
Springer
15 years 4 months ago
Of robot ants and elephants
Investigations of multi-robot systems often make implicit assumptions concerning the computational capabilities of the robots. Despite the lack of explicit attention to the comput...
Asaf Shiloni, Noa Agmon, Gal A. Kaminka
SIGIR
2009
ACM
15 years 4 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
MIDDLEWARE
2004
Springer
15 years 3 months ago
On the benefits of decomposing policy engines into components
In order for middleware systems to be adaptive, their properties and services need to support a wide variety of application-specific policies. However, application developers and ...
Konstantin Beznosov