Sciweavers

78 search results - page 2 / 16
» Large Equiangular Sets of Lines in Euclidean Space
Sort
View
COMPGEOM
2009
ACM
13 years 11 months ago
Binary plane partitions for disjoint line segments
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...
Csaba D. Tóth
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
13 years 10 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 2 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
ISVD
2007
IEEE
13 years 11 months ago
Two-dimensional line space Voronoi Diagram
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
Stéphane Rivière, Dominique Schmitt
CVPR
1998
IEEE
14 years 6 months ago
Clustering Appearances of 3D Objects
We introduce a method for unsupervised clustering of images of 3D objects. Our method examines the space of all images and partitions the images into sets that form smooth and par...
Ronen Basri, Dan Roth, David W. Jacobs