430 search results - page 53 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
125
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
139
Voted
DSN
2005
IEEE
15 years 10 months ago
2005
IEEE
Common practice in anomaly-based intrusion detection assumes that one size fits all: a single anomaly detector should detect all anomalies. Compensation for any performance short...
136
Voted
3DIM
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
275
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
263
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...