1149 search results - page 183 / 230 » Minimally non-Pfaffian graphs |
112
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
— In this paper, we examine the impact of application task mapping on the reliability of MPSoC in the presence of single-event upsets (SEUs). We propose a novel soft erroraware d...
102
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
106
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
EVOW
2008
Springer
15 years 1 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...