Sciweavers

119 search results - page 11 / 24
» A relaxed approach to combinatorial problems in robustness a...
Sort
View
TISSEC
2002
123views more  TISSEC 2002»
13 years 8 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield
IJCV
2002
84views more  IJCV 2002»
13 years 8 months ago
Algorithmic Fusion for More Robust Feature Tracking
We present a framework for merging the results of independent featurebased motion trackers using a classification based approach. We demonstrate the efficacy of the framework usin...
Brendan McCane, Ben Galvin, Kevin Novins
APIN
1999
114views more  APIN 1999»
13 years 8 months ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng
BILDMED
2006
169views Algorithms» more  BILDMED 2006»
13 years 10 months ago
Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
Karsten Rink, Arne-Michael Törsel, Klaus D. T...
CVPR
2004
IEEE
14 years 10 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...