1101 search results - page 168 / 221 » An Algorithm for the Graph Crossing Number Problem |
143
click to vote
SODA
2010
ACM
15 years 10 days ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
126
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
133
click to vote
ECCC
2010
15 years 16 days ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
137
click to vote
WSDM
2012
ACM
13 years 9 months ago
2012
ACM
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...
119
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...