Sciweavers

2004 search results - page 107 / 401
» Sampling from large graphs
Sort
View
ICCS
2005
Springer
15 years 8 months ago
High-Fidelity Simulation of Large-Scale Structures
Active structures capable of responding to external stimulii represent the emerging frontier in structural design. Robust and real-time sensing, control, and actuation pose fundame...
Christoph Hoffmann, Ahmed H. Sameh, Ananth Grama
VLSID
1996
IEEE
130views VLSI» more  VLSID 1996»
15 years 7 months ago
A systolic architecture for LMS adaptive filtering with minimal adaptation delay
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...
S. Ramanathan, V. Visvanathan
LCTRTS
2007
Springer
15 years 9 months ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
BMCBI
2004
139views more  BMCBI 2004»
15 years 2 months ago
Resolution of large and small differences in gene expression using models for the Bayesian analysis of gene expression levels an
Background: The detection of small yet statistically significant differences in gene expression in spotted DNA microarray studies is an ongoing challenge. Meeting this challenge r...
Jeffrey P. Townsend
SAC
2005
ACM
15 years 8 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa