201 search results - page 39 / 41 » Reducing the number of clock variables of timed automata |
COMPLEXITY
2004
13 years 7 months ago
2004
: Explaining the maintenance of sexual reproduction remains one of the greatest challenges in biology. The theoretical oddity of sex is based on at least three advantages that asex...
IPL
2002
13 years 7 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
ICSM
1995
IEEE
13 years 11 months ago
1995
IEEE
Organizations spend significant resources tracking customer satisfaction and managing service delivery. Although a great deal of effort is expended in understanding what goes on w...
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the ...