725 search results - page 90 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
109
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
279
Voted
DIMACS
1996
15 years 4 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
125
Voted
ICFP
2003
ACM
16 years 2 months ago
2003
ACM
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
162
Voted
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
127
click to vote
ENTCS
2002
15 years 2 months ago
2002
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...