352 search results - page 29 / 71 » On the optimal reachability problem of weighted timed automa... |
106
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
109
Voted
MP
2006
15 years 10 days ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
98
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
103
Voted
CEC
2005
IEEE
15 years 2 months ago
2005
IEEE
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
104
Voted
KES
2004
Springer
15 years 5 months ago
2004
Springer
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...