Sciweavers

906 search results - page 67 / 182
» Map graphs
Sort
View
TDSC
2008
83views more  TDSC 2008»
13 years 7 months ago
A Precise Termination Condition of the Probabilistic Packet Marking Algorithm
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
T. Y. Wong, Man Hon Wong, John C. S. Lui
IJCV
2006
115views more  IJCV 2006»
13 years 7 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...
CONCUR
2006
Springer
13 years 11 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
KI
2009
Springer
14 years 2 months ago
Maximum a Posteriori Estimation of Dynamically Changing Distributions
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
Michael Volkhardt, Sören Kalesse, Steffen M&u...
CSJM
2006
81views more  CSJM 2006»
13 years 7 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu