Sciweavers

1022 search results - page 63 / 205
» New models and algorithms for programmable networks
Sort
View
NIPS
2008
15 years 2 months ago
Evaluating probabilities under high-dimensional latent variable models
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
Iain Murray, Ruslan Salakhutdinov
CEC
2010
IEEE
14 years 7 months ago
Parameter estimation with term-wise decomposition in biochemical network GMA models by hybrid regularized Least Squares-Particle
High-throughput analytical techniques such as nuclear magnetic resonance, protein kinase phosphorylation, and mass spectroscopic methods generate time dense profiles of metabolites...
Prospero C. Naval, Luis G. Sison, Eduardo R. Mendo...
128
Voted
TCS
2010
14 years 7 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....
102
Voted
TACAS
2010
Springer
210views Algorithms» more  TACAS 2010»
15 years 7 months ago
Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
Alastair F. Donaldson, Daniel Kroening, Philipp R&...
ISQED
2005
IEEE
120views Hardware» more  ISQED 2005»
15 years 6 months ago
Passive Hierarchical Model Order Reduction and Realization of RLCM Circuits
This paper presents a novel compact passive modeling technique for high-performance RF passives and interconnects modeled as high-order RLCM circuits. The new method is based on a...
Pu Liu, Zhenyu Qi, Sheldon X.-D. Tan