2925 search results - page 16 / 585 » Information Complexity of Online Problems |
134
click to vote
MFCS
2010
Springer
15 years 8 days ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
117
Voted
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
139
click to vote
AAAI
1996
15 years 3 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
95
Voted
APWEB
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
115
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...