Sciweavers

49 search results - page 1 / 10
» On Fast and Approximate Attack Tree Computations
Sort
View
ISPEC
2010
Springer
13 years 10 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
ICPR
2006
IEEE
14 years 6 months ago
Metric tree partitioning and Taylor approximation for fast support vector classification
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
Thang V. Pham, Arnold W. M. Smeulders
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 5 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
CVPR
2011
IEEE
13 years 1 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
ACSC
2003
IEEE
13 years 10 months ago
A Practical Method to Counteract Denial of Service Attacks
Today distributed denial of service (DDoS) attacks are causing major problems to conduct online business over the Internet. Recently several schemes have been proposed on how to p...
Udaya Kiran Tupakula, Vijay Varadharajan