1200 search results - page 66 / 240 » Marked Ancestor Problems |
91
Voted
AIEDAM
1999
15 years 12 days ago
1999
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
100
Voted
TIP
2002
15 years 10 days ago
2002
Watermarkingwith both obliviousdetection and high robustness capabilities is still a challenging problem. The existing methods are either robust or oblivious, but it is di cult to...
132
click to vote
INFSOF
2008
15 years 6 days ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
116
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
108
Voted
EMNLP
2009
14 years 10 months ago
2009
The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW l...