Sciweavers

4949 search results - page 159 / 990
» Consistency and Set Intersection
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 6 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
BMVC
1998
15 years 6 months ago
Planar Curve Representation and Matching
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
Maher Al-Khaiyat, Farhad Kamangar
GISCIENCE
2008
Springer
115views GIS» more  GISCIENCE 2008»
15 years 5 months ago
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
Edward Verbree, Hang Si
CVPR
2010
IEEE
15 years 4 months ago
Deconvolutional networks
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
Matthew D. Zeiler, Dilip Krishnan, Graham W. Taylo...
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 4 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin