2612 search results - page 299 / 523 » Switching Graphs and Their Complexity |
158
click to vote
SBBD
2007
15 years 6 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
133
Voted
ICVGIP
2004
15 years 6 months ago
2004
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
143
click to vote
MASCOTS
2003
15 years 6 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
115
click to vote
SIROCCO
2003
15 years 6 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
127
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...