4110 search results - page 462 / 822 » Efficient algorithms for the 2-gathering problem |
188
click to vote
KDD
1994
ACM
15 years 10 months ago
1994
ACM
: Most of Knowledge Discovery in Database (KDD) systems are integrating efficient Machine Learning techniques. In fact issues in Machine Learning and KDD are very close allowing fo...
194
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
174
click to vote
ATVA
2004
Springer
15 years 10 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
183
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
176
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...