Sciweavers

246 search results - page 32 / 50
» Stable domination and weight
Sort
View
ITIIS
2010
138views more  ITIIS 2010»
13 years 8 months ago
Performance Analysis of Large CDMA Random Access Systems with Retransmission Diversity over Fading Channels
The random access systems, with retransmission diversity (RD) employment, over large random spreading code division multiple access (CDMA) channel subject to fading is investigate...
Kai Yu, Yi Sun, Pingzhi Fan, Xianfu Lei, Lei Shu
TIT
2010
103views Education» more  TIT 2010»
13 years 4 months ago
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
INFOCOM
2003
IEEE
14 years 3 months ago
Input Queued Switches: Cell Switching vs. Packet Switching
— Input Queued(IQ) switches have been very well studied in the recent past. The main problem in the IQ switches concerns scheduling. The main focus of the research has been the ï...
Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah
ECCV
2010
Springer
14 years 3 months ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 1 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...