184 search results - page 20 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
RAID
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Attack analysis is a challenging problem, especially in emerging environments where there are few known attack cases. One such new environment is the Mobile Ad hoc Networ...
ECCV
2000
Springer
14 years 10 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
CVPR
2005
IEEE
15 years 5 months ago
2005
IEEE
"In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and theref...
SNPD
2007
13 years 10 months ago
2007
In this paper, we propose a new class of interconnection networks, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simp...
BIRTHDAY
1994
Springer
14 years 22 days ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...