Sciweavers

3267 search results - page 125 / 654
» Generalized quasirandom graphs
Sort
View
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
14 years 9 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
SPIRE
2009
Springer
15 years 5 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
DAC
2006
ACM
16 years 8 days ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten
WWW
2007
ACM
15 years 12 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...
IV
2009
IEEE
191views Visualization» more  IV 2009»
15 years 6 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber