Sciweavers

12194 search results - page 2163 / 2439
» Numberings Optimal for Learning
Sort
View
174
Voted
TISSEC
2008
202views more  TISSEC 2008»
15 years 6 months ago
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
compromised sensor nodes. The framework provides an appropriate abstraction of applicationspecific detection mechanisms and models the unique properties of sensor networks. Based o...
Qing Zhang, Ting Yu, Peng Ning
TIT
2008
101views more  TIT 2008»
15 years 6 months ago
Low-Rate Repeat-Zigzag-Hadamard Codes
In this paper, we propose a new class of low-rate error correction codes called repeat-zigzag-Hadamard (RZH) codes featuring simple encoder and decoder structures, and flexible cod...
Kai Li, Guosen Yue, Xiaodong Wang, Li Ping
TIT
2008
127views more  TIT 2008»
15 years 6 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
TIT
2008
102views more  TIT 2008»
15 years 6 months ago
Approaching the Zero-Outage Capacity of MIMO-OFDM Without Instantaneous Water-Filling
Orthogonal-frequency-divisionmultiplexing(OFDM) transforms a frequency-selective multiple-input multiple-output (MIMO) fading channel into a MIMO-OFDM channel that has a well-defin...
Joon Hyun Sung, John R. Barry
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
« Prev « First page 2163 / 2439 Last » Next »