Sciweavers

8810 search results - page 330 / 1762
» Open. Closed. Open
Sort
View
JMIV
1998
93views more  JMIV 1998»
15 years 6 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
MAM
2002
128views more  MAM 2002»
15 years 6 months ago
Component-based development of DSP software for mobile communication terminals
DSP software development has been tied down by extreme computational requirements. Furthermore, the DSP development tools available today are less advanced than in other embedded ...
Kari Jyrkkä, Olli Silvén, Olli Ali-Yrk...
GLOBECOM
2010
IEEE
15 years 4 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo
CSI
2011
219views Social Sciences» more  CSI 2011»
15 years 1 months ago
Estimation method for the consciousness level while driving vehicles
Automobile industry is required extremely energy saving, and active safety technology. The study has been estimation consciousness and concentration using shoulder line, quantity o...
T. Sugimoto, A. Tohshima
JCT
2010
127views more  JCT 2010»
15 years 1 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster