2168 search results - page 179 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
153
click to vote
ALT
1995
Springer
15 years 8 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
156
Voted
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
127
click to vote
KDD
2009
ACM
15 years 9 months ago
2009
ACM
Commercial anti-virus software are unable to provide protection against newly launched (a.k.a “zero-day”) malware. In this paper, we propose a novel malware detection techniqu...
137
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
The ability to account for the growing impacts of multiple process variations in modern technologies is becoming an integral part of nanometer VLSI design. Under the context of ti...
141
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Malware — a generic term that encompasses viruses, trojans, spywares and other intrusive code — is widespread today. Malware analysis is a multi-step process providing insight...