Sciweavers

3913 search results - page 642 / 783
» complexity 2006
Sort
View
113
Voted
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 3 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 3 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
51
Voted
CORR
2006
Springer
77views Education» more  CORR 2006»
15 years 3 months ago
Deductive Object Programming
We propose some slight additions to O-O languages to implement the necessary features for using Deductive Object Programming (DOP). This way of programming based upon the manipula...
François Colonna
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 3 months ago
Emergence Explained
Abstract. Emergence--macro-level effects from micro-level causes--is at the heart of the conflict between reductionism and functionalism. How can there be autonomous higher level l...
Russ Abbott
102
Voted
CORR
2006
Springer
52views Education» more  CORR 2006»
15 years 3 months ago
A SIMO Fiber Aided Wireless Network Architecture
Abstract-- The concept of a fiber aided wireless network architecture (FAWNA) is introduced in [Ray et al., Allerton Conference 2005], which allows high-speed mobile connectivity b...
Siddharth Ray, Muriel Médard, Lizhong Zheng