713 search results - page 88 / 143 » Laplacian mesh optimization |
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
AAAI
2008
13 years 10 months ago
2008
Fisher score and Laplacian score are two popular feature selection algorithms, both of which belong to the general graph-based feature selection framework. In this framework, a fe...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
NIPS
2003
13 years 9 months ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...