1729 search results - page 263 / 346 » Bound Graph Polysemy |
151
Voted
POPL
1996
ACM
15 years 9 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
145
click to vote
EVOW
2010
Springer
15 years 9 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
161
click to vote
CAINE
2008
15 years 6 months ago
2008
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...
149
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
138
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...