Sciweavers

1439 search results - page 164 / 288
» Fast approximation of centrality
Sort
View
130
Voted
CISS
2008
IEEE
15 years 10 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
147
Voted
VISUALIZATION
1997
IEEE
15 years 7 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
128
Voted
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 7 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
JBCB
2007
161views more  JBCB 2007»
15 years 3 months ago
On Cooperative Quasi-Equilibrium Models of transcriptional Regulation
Mechanistic models for transcriptional regulation are derived using the methods of equilibrium statistical mechanics, to model equilibrating processes that occur at a fast time sc...
Eric Mjolsness
TSP
2010
14 years 10 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji