Sciweavers

214 search results - page 39 / 43
» Computing the Closest Point to a Circle
Sort
View
CIDM
2007
IEEE
14 years 1 months ago
Incremental Local Outlier Detection for Data Streams
Outlier detection has recently become an important problem in many industrial and financial applications. This problem is further complicated by the fact that in many cases, outlie...
Dragoljub Pokrajac, Aleksandar Lazarevic, Longin J...
COCOON
1998
Springer
13 years 11 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
ISMAR
2003
IEEE
14 years 23 days ago
A real-time tracker for markerless augmented reality
Augmented Reality has now progressed to the point where real-time applications are being considered and needed. At the same time it is important that synthetic elements are render...
Andrew I. Comport, Éric Marchand, Fran&cced...
JMIV
2007
143views more  JMIV 2007»
13 years 7 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
COMPGEOM
2006
ACM
14 years 1 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir