5607 search results - page 805 / 1122 » Graph structure in the Web |
213
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Low-density parity-check codes using the beliefpropagation decoding algorithm tend to exhibit a high error floor in the bit error rate curves, when some problematic graphical stru...
190
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...
157
click to vote
ATVA
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
196
click to vote
COCOA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
178
click to vote
PET
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...