727 search results - page 62 / 146 » Private approximation of search problems |
113
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
106
Voted
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
109
Voted
PODS
2008
ACM
16 years 24 days ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
207
click to vote
SIGMOD
2008
ACM
16 years 25 days ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
189
Voted
SDM
2012
SIAM
13 years 3 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...