Sciweavers

5889 search results - page 247 / 1178
» Graph Layout Problems
Sort
View
ICPP
2006
IEEE
16 years 20 days ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
CN
2007
95views more  CN 2007»
15 years 6 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...
COMBINATORICS
2004
130views more  COMBINATORICS 2004»
15 years 6 months ago
On-line Ramsey Theory
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Ki...
ICDAR
2009
IEEE
16 years 1 months ago
An RDF-Based Blackboard Architecture for Improving Table Analysis
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
Vanessa Long
SPAA
2004
ACM
16 years 1 days ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson