107 search results - page 12 / 22 » An incremental algorithm for computing ranked full disjuncti... |
110
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
159
click to vote
GROUP
2010
ACM
15 years 1 months ago
2010
ACM
Looking for source code on the Web is a common practice among software developers. Previous research has shown that developers use social cues over technical cues to evaluate sour...
IPL
2010
15 years 1 months ago
2010
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
130
click to vote
SIAMSC
2010
15 years 1 months ago
2010
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
121
click to vote
CCCG
2008
15 years 4 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....