2652 search results - page 104 / 531 » Path Differentials and Applications |
146
click to vote
EJC
2008
15 years 2 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
165
click to vote
NMA
2010
15 years 2 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
135
click to vote
JCNS
2010
14 years 11 months ago
2010
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
143
click to vote
TSMC
2010
14 years 11 months ago
2010
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...
269
click to vote
ISMIS
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...