1243 search results - page 78 / 249 » Complexity reduction of C-Algorithm |
120
click to vote
IJON
2008
14 years 12 months ago
2008
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
108
click to vote
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
121
click to vote
TCOM
2011
14 years 8 months ago
2011
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
123
click to vote
TSP
2010
14 years 8 months ago
2010
Graphical models are a framework for representing and exploiting prior conditional independence structures within distributions using graphs. In the Gaussian case, these models are...