Sciweavers

4761 search results - page 777 / 953
» Generalizing Boundary Points
Sort
View
91
Voted
SIGKDD
2000
95views more  SIGKDD 2000»
15 years 17 days ago
Scalability for Clustering Algorithms Revisited
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
Fredrik Farnstrom, James Lewis, Charles Elkan
93
Voted
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
15 years 15 days ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
104
Voted
COMGEO
1998
ACM
15 years 15 days ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas
168
Voted
IJCV
2002
167views more  IJCV 2002»
15 years 15 days ago
On the Consistency of Instantaneous Rigid Motion Estimation
Instantaneous camera motion estimation is an important research topic in computer vision. Although in theory more than five points uniquely determine the solution in an ideal situa...
Tong Zhang, Carlo Tomasi
94
Voted
CORR
1998
Springer
82views Education» more  CORR 1998»
15 years 15 days ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts