Sciweavers

1158 search results - page 171 / 232
» Template Generation and Selection Algorithms
Sort
View
DFT
2006
IEEE
203views VLSI» more  DFT 2006»
15 years 10 months ago
Self Testing SoC with Reduced Memory Requirements and Minimized Hardware Overhead
This paper describes a methodology of creating a built-in diagnostic system of a System on Chip and experimental results of the system application on the AT94K FPSLIC with cores d...
Ondrej Novák, Zdenek Plíva, Jiri Jen...
ICML
2010
IEEE
15 years 5 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
CGF
2008
182views more  CGF 2008»
15 years 4 months ago
Lazy Solid Texture Synthesis
Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restri...
Yue Dong, Sylvain Lefebvre, Xin Tong, George Drett...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 5 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
141
Voted
SPAA
2010
ACM
15 years 4 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis