2006 search results - page 380 / 402 » Heuristic Security-Testing Methods |
173
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
RECOMB
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Recent studies demonstrating the existence of special non-coding "antisense" RNAs used in post-transcriptional gene regulation have received considerable attent...
CADE
2005
Springer
15 years 11 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
172
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
182
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...