Sciweavers

279 search results - page 26 / 56
» Type-II Optimal Polynomial Bases
Sort
View
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
14 years 26 days ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
ICASSP
2011
IEEE
13 years 14 days ago
Compact support kernels based time-frequency distributions: Performance evaluation
This paper presents two new time-frequency distributions based on kernels with compact support (KCS) namely the separable CB (SCB) and the polynomial CB (PCB) TFDs. The implementa...
Mansour Abed, Adel Belouchrani, Mohamed Cheriet, B...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
INFFUS
2008
175views more  INFFUS 2008»
13 years 8 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
14 years 9 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne