2069 search results - page 183 / 414 » Linear time algorithms for Clobber |
143
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
171
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
283
click to vote
SIGIR
2012
ACM
13 years 7 months ago
2012
ACM
As ever-larger training sets for learning to rank are created, scalability of learning has become increasingly important to achieving continuing improvements in ranking accuracy [...
140
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
147
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...