1299 search results - page 150 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
RAID
2001
Springer
15 years 2 months ago
2001
Springer
With the growing deployment of host and network intrusion detection systems, managing reports from these systems becomes critically important. We present a probabilistic approach t...
100
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
119
click to vote
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
113
click to vote
TVCG
2011
14 years 4 months ago
2011
—We present the first parallel surface reconstruction algorithm that runs entirely on the GPU. Like existing implicit surface reconstruction methods, our algorithm first builds...