Sciweavers

2612 search results - page 301 / 523
» Switching Graphs and Their Complexity
Sort
View
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
15 years 3 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
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,...
Johannes Schneider, Roger Wattenhofer
IPPS
2010
IEEE
15 years 2 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
BIOCOMP
2010
15 years 1 months ago
A Network-based Approach to Classify Disease Stages of Prostate Cancer Using Quantitative Network Measures
Abstract-- This study deals with investigating the classification performance of information-theoretic measures when applied to complex biological networks. In particular, our aim ...
Laurin A. J. Mueller, Karl G. Kugler, Andreas Dand...
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 8 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
ASUNAM
2011
IEEE
14 years 5 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...