809 search results - page 20 / 162 » 04421 Abstracts Collection - Algebraic Methods in Computatio... |
155
Voted
CSR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
142
Voted
JACM
2007
15 years 3 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
107
Voted
MP
2010
15 years 2 months ago
2010
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
99
Voted
ICCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...
136
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...