1046 search results - page 78 / 210 » Approximation Algorithms for Domination Search |
186
Voted
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
130
Voted
ENTCS
2006
15 years 16 days 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 ...
96
Voted
IJCAI
2007
15 years 1 months ago
2007
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly converge to an approximate solution for medium-sized problems...
122
Voted
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
104
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...