7006 search results - page 359 / 1402 » Approximation Algorithms |
170
click to vote
ENTCS
2006
15 years 4 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
141
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
140
click to vote
CVIU
2008
15 years 4 months ago
2008
The estimation of parametric global motion is one of the cornerstones of computer vision. Such schemes are able to estimate various motion models (translation, rotation, affine, p...
102
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
147
click to vote
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...