5100 search results - page 957 / 1020 » The Linear Complexity of a Graph |
130
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to sto...
142
click to vote
ICCCN
2008
IEEE
15 years 11 months ago
2008
IEEE
— Centrality is a concept often used in social network analysis to study different properties of networks that are modeled as graphs. We present a new centrality metric called Lo...
161
click to vote
COMSWARE
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
143
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
111
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
Consumer electronics products, such as high-end (digital) TVs, contain complex systems on chip (SOC) that offer high computational performance at low cost. Traditionally, these SO...