2479 search results - page 155 / 496 » Quantum complexity theory |
196
click to vote
PODC
2006
ACM
16 years 23 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
193
Voted
AI
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
222
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
170
click to vote
ECCC
2010
15 years 5 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
191
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
There is a widespread intuitive sense that different kinds of information spread differently on-line, but it has been difficult to evaluate this question quantitatively since it ...