Sciweavers

478 search results - page 69 / 96
» Structural Properties of Twin-Free Graphs
Sort
View
WWW
2008
ACM
16 years 4 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
108
Voted
IJON
2007
84views more  IJON 2007»
15 years 3 months ago
Modeling self-developing biological neural networks
Recent progress in chips–neuron interface suggests real biological neurons as long-term alternatives to silicon transistors. The first step ning such computing systems is to bu...
Hugues Berry, Olivier Temam
METRICS
1999
IEEE
15 years 8 months ago
Measuring Coupling and Cohesion: An Information-Theory Approach
The design of software is often depicted by graphs that show components and their relationships. For example, a structure chart shows the calling relationships among components. O...
Edward B. Allen, Taghi M. Khoshgoftaar
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 4 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
RSA
2010
107views more  RSA 2010»
15 years 2 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou