20294 search results - page 402 / 4059 » Algorithmic Information Theory |
194
click to vote
TACAS
2009
Springer
16 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
180
click to vote
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Object tracking based on Mean Shift (MS) algorithm has been very successful and thus receives significant research interests. Unfortunately, traditional MS based tracking only ut...
202
click to vote
WIDM
2004
ACM
16 years 1 months ago
2004
ACM
The explosive growth of the web is at the basis of the great interest into web usage mining techniques in both commercial and research areas. In this paper, a web personalization ...
193
click to vote
JHSN
2002
15 years 7 months ago
2002
: In the future, we are likely to see a tremendous rise in mobile computing and communications as ubiquitous applications incorporate multimedia information. These mobile multimedi...
217
Voted
CORR
2010
Springer
15 years 7 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...