Sciweavers

5019 search results - page 50 / 1004
» On the Reflexivity of Point Sets
Sort
View
DATAMINE
2006
166views more  DATAMINE 2006»
15 years 6 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
GI
2009
Springer
15 years 11 months ago
Barcode Application Innovation for Smartphones
: Modern smartphones provide a high sophisticated camera and a high resolution display. Therefore, they can be used to enable various application scenarios for 1D and 2D barcode re...
Gerald Eichler, Karl-Heinz Lüke, Aykan Aydin,...
SSIAI
2002
IEEE
15 years 11 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 7 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
ACMMPC
2000
Springer
231views Mathematics» more  ACMMPC 2000»
15 years 10 months ago
Galois Connections and Fixed Point Calculus
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
Roland Carl Backhouse