937 search results - page 84 / 188 » On the Complexity of Partial Order Properties |
170
click to vote
RTSS
2008
IEEE
16 years 14 days ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
168
click to vote
DAM
2011
15 years 1 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
164
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
152
click to vote
CIVR
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
155
click to vote
GPEM
2007
15 years 6 months ago
2007
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...