165 search results - page 19 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
106
click to vote
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
CVPR
2007
IEEE
16 years 1 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...
87
Voted
WSC
2008
15 years 2 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
111
click to vote
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
177
click to vote
ICDT
2009
ACM
16 years 10 days ago
2009
ACM
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...