Sciweavers

588 search results - page 80 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
IJCGA
2002
69views more  IJCGA 2002»
13 years 9 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers
OL
2010
185views more  OL 2010»
13 years 8 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
SIGIR
2005
ACM
14 years 3 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
CVPR
2003
IEEE
14 years 12 months ago
PAMPAS: Real-Valued Graphical Models for Computer Vision
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
Michael Isard
DPD
2002
125views more  DPD 2002»
13 years 9 months ago
Parallel Mining of Outliers in Large Database
Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like mon...
Edward Hung, David Wai-Lok Cheung