385 search results - page 1 / 77 » Tracking the Best Disjunction |
FOCS
1995
IEEE
13 years 9 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
ECP
1999
Springer
13 years 10 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
ASP
2003
Springer
13 years 11 months ago
2003
Springer
We present CR-Prolog2, an extension of A-Prolog with cr-rules and ordered disjunction. CR-rules can be used to formalize various types of common-sense knowledge and reasoning, tha...
LPNMR
2005
Springer
13 years 11 months ago
2005
Springer
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
DAGM
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. Guided Kanade-Lucas-Tomasi (GKLT) tracking is a suitable way to incorporate knowledge about camera parameters into the standard KLT tracking approach for feature tracking...