708 search results - page 53 / 142 » Timing closure: the solution and its problems |
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
ICIP
2009
IEEE
15 years 11 months ago
2009
IEEE
On-line action recognition from a continuous stream of actions is still an open problem with fewer solutions proposed compared to time-segmented action recognition. The most chall...
BCS
2008
14 years 11 months ago
2008
We propose a defi nition of Cellular Automaton in which links between cells can change during the computation. This is done locally by each cell, which can reach the neighbours of...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...