Sciweavers

100 search results - page 4 / 20
» Simple Analysis of Graph Tests for Linearity and PCP
Sort
View
CORR
2010
Springer
166views Education» more  CORR 2010»
14 years 11 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari
108
Voted
AGTIVE
1999
Springer
15 years 3 months ago
DiTo - A Distribution Tool Based on Graph Rewriting
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
Ansgar Radermacher
BMCBI
2007
150views more  BMCBI 2007»
14 years 11 months ago
Refining intra-protein contact prediction by graph analysis
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...
Milana Frenkel-Morgenstern, Rachel Magid, Eran Eya...
91
Voted
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
15 years 12 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
118
Voted
CPHYSICS
2006
124views more  CPHYSICS 2006»
14 years 11 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...