Sciweavers

7189 search results - page 42 / 1438
» Connecting Design with Code
Sort
View
PPOPP
2012
ACM
13 years 7 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
ECBS
2006
IEEE
115views Hardware» more  ECBS 2006»
15 years 5 months ago
Supporting Design Patterns with Annotations
Design patterns are an established means for building evolvable and maintainable object-oriented software. However, using them requires the developer’s extensive experience. A w...
Klaus Meffert
CORR
2004
Springer
83views Education» more  CORR 2004»
14 years 11 months ago
Generating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
Guy Melançon, Fabrice Philippe
IJCNN
2008
IEEE
15 years 6 months ago
Evolving a neural network using dyadic connections
—Since machine learning has become a tool to make more efficient design of sophisticated systems, we present in this paper a novel methodology to create powerful neural network ...
Andreas Huemer, Mario A. Góngora, David A. ...
TCOM
2008
117views more  TCOM 2008»
14 years 11 months ago
Nested turbo codes for the Costa problem
Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has la...
Yong Sun, Momin Uppal, Angelos D. Liveris, Samuel ...