2069 search results - page 239 / 414 » Linear time algorithms for Clobber |
162
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
We propose novel spatio-temporal models to estimate clickthrough rates in the context of content recommendation. We track article CTR at a fixed location over time through a dynam...
161
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
177
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
167
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
175
click to vote
GLOBECOM
2007
IEEE
16 years 26 days ago
2007
IEEE
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...