1736 search results - page 220 / 348 » The rank-width of Directed Graphs |
154
click to vote
RANDOM
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
185
click to vote
HICSS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
279
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
162
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
168
click to vote
AUIC
2005
IEEE
16 years 3 days ago
2005
IEEE
The augmented desk is gaining popularity in recent HCI research. Its layout of a large horizontal screen on the desk enhances immersive and intense collaborative experiences. A re...