Sciweavers

446 search results - page 71 / 90
» Extremal Stable Graphs
Sort
View
TIT
2010
103views Education» more  TIT 2010»
13 years 3 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...
PAM
2012
Springer
12 years 4 months ago
Re-wiring Activity of Malicious Networks
This paper studies the AS-level re-wiring dynamics (changes in the connectivity) of malicious networks. Anecdotal evidence suggests that some malicious ASes that are primarily invo...
Maria Konte, Nick Feamster
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 17 days ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 10 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
AI
2010
Springer
13 years 8 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina