Sciweavers

4761 search results - page 329 / 953
» Generalizing Boundary Points
Sort
View
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
15 years 10 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
WOTUG
2008
15 years 8 months ago
FPGA based Control of a Production Cell System
Most motion control systems for mechatronic systems are implemented on digital computers. In this paper we present an FPGA based solution implemented on a low cost Xilinx Spartan I...
Marcel A. Groothuis, Jasper J. P. van Zuijlen, Jan...
BMVC
2000
15 years 8 months ago
The Cross Ratio: A Revisit to its Probability Density Function
The cross ratio has wide applications in computer vision because of its invariance under projective transformation. In active vision where the projections of quadruples of colline...
D. Q. Huynh
ATAL
2010
Springer
15 years 8 months ago
Manipulation of copeland elections
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 8 months ago
Image registration using genetic algorithms
This paper addresses the image registration problem applying genetic algorithms. The image registration’s objective is the definition of a mapping that best match two set of poi...
Flávio Luiz Seixas, Luiz Satoru Ochi, Aura ...