6110 search results - page 221 / 1222 » Approximate Computing |
174
click to vote
DFG
2007
Springer
16 years 21 days ago
2007
Springer
: The concept of natural neighbors employs the notion of distance to define local neighborhoods in discrete data. Especially when querying and accessing large scale data, it is im...
151
click to vote
WADS
2007
Springer
16 years 19 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
175
click to vote
IFIP
2005
Springer
16 years 1 days ago
2005
Springer
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
170
click to vote
MFCS
2005
Springer
16 years 1 days ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
150
click to vote
CMMR
2003
Springer
15 years 11 months ago
2003
Springer
In the context of musical analysis, we propose an algorithm that automatically induces patterns from polyphonies. We define patterns as “perceptible repetitions in a musical piec...