Sciweavers

828 search results - page 74 / 166
» Simplicial Powers of Graphs
Sort
View
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ICCD
2004
IEEE
115views Hardware» more  ICCD 2004»
14 years 4 months ago
Generating Monitor Circuits for Simulation-Friendly GSTE Assertion Graphs
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
Kelvin Ng, Alan J. Hu, Jin Yang
WAW
2007
Springer
85views Algorithms» more  WAW 2007»
14 years 1 months ago
A Spatial Web Graph Model with Local Influence Regions
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
William Aiello, Anthony Bonato, C. Cooper, Jeannet...
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
13 years 9 months ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
IEEEHPCS
2010
13 years 5 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...