5606 search results - page 542 / 1122 » Randomization Techniques for Graphs. |
207
click to vote
TVCG
2010
15 years 5 months ago
2010
— While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction tec...
223
click to vote
TON
2010
15 years 1 months ago
2010
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
213
click to vote
ECRTS
2008
IEEE
16 years 1 months ago
2008
IEEE
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
196
click to vote
CIKM
2005
Springer
16 years 22 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
189
click to vote
VLDB
1994
ACM
15 years 11 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...