3368 search results - page 289 / 674 » The Complexity of Query Reliability |
271
click to vote
JPDC
2007
15 years 6 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
186
click to vote
ENTCS
2002
15 years 6 months ago
2002
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
195
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
The power of search is with no doubt one of the main aspects for the success of the Web. Currently available search engines on the Web allow to return results with a high precisio...
149
Voted
TIME
2002
IEEE
15 years 11 months ago
2002
IEEE
We show the expressiveness provided by a Labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to mana...
166
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...