2569 search results - page 90 / 514 » Approximate Objects and Approximate Theories |
145
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...
170
click to vote
PRL
2006
15 years 6 months ago
2006
: As an extension to 2DPCA, Generalized Low Rank Approximation of Matrices (GLRAM) applies two-sided (i.e., the left and right) rather than single-sided (i.e., the left or the righ...
166
click to vote
TCS
2008
15 years 6 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
203
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
172
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...