Sciweavers

312 search results - page 40 / 63
» Restricting and Embedding Imperatives
Sort
View
142
Voted
CSUR
1999
114views more  CSUR 1999»
15 years 3 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
175
Voted
IJON
2011
133views more  IJON 2011»
14 years 11 months ago
Relational generative topographic mapping
Abstract. The generative topographic mapping (GTM) has been proposed as a statistical model to represent high dimensional data by means of a sparse lattice of points in latent spac...
Andrej Gisbrecht, Bassam Mokbel, Barbara Hammer
145
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
119
Voted
DAC
2006
ACM
16 years 4 months ago
Exploiting forwarding to improve data bandwidth of instruction-set extensions
Application-specific instruction-set extensions (custom instructions) help embedded processors achieve higher performance. Most custom instructions offering significant performanc...
Ramkumar Jayaseelan, Haibin Liu, Tulika Mitra
JTRES
2009
ACM
15 years 10 months ago
On transforming Java-like programs into memory-predictable code
The ScopedMemory class of the RTSJ enables the organization of objects into regions. This ensures time-predictable management of dynamic memory. Using scopes forces the programmer...
Diego Garbervetsky, Sergio Yovine, Víctor A...