4581 search results - page 440 / 917 » Computing Transformation Semigroups |
223
click to vote
CSDA
2008
15 years 7 months ago
2008
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
199
click to vote
CGF
2007
15 years 7 months ago
2007
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, f...
213
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
241
click to vote
COLING
2008
15 years 6 months ago
2008
The most critical issue in generating and recognizing paraphrases is development of wide-coverage paraphrase knowledge. Previous work on paraphrase acquisition has collected lexic...
250
Voted
ISPDC
2010
IEEE
15 years 6 months ago
2010
IEEE
—This paper presents an operational semantics of the repetitive model of computation, which is the basis for the repetitive structure modeling (RSM) package defined in the stand...