305 search results - page 61 / 61 » A Robust Interest Points Matching Algorithm |
SIAMIS
2010
13 years 6 days ago
2010
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
CIKM
2003
Springer
13 years 10 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
Abstract. An accurate analysis of a large dynamic system like our oceans requires spatially fine and temporally matched data collection methods. Current methods to estimate fish st...