855 search results - page 141 / 171 » Complexity of Equations over Sets of Natural Numbers |
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
110
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
107
click to vote
BMCBI
2007
14 years 12 months ago
2007
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
129
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
126
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...