3270 search results - page 144 / 654 » Approximate String Processing |
101
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...
122
Voted
SIAMSC
2008
15 years 2 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
96
Voted
INFORMATICASI
2007
15 years 2 months ago
2007
In this paper we deal with the problem of addition of new documents in collection when documents are represented in lower dimensional space by concept indexing. Concept indexing i...
112
click to vote
CGF
2004
15 years 2 months ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
124
click to vote
IPMU
2010
Springer
15 years 25 days ago
2010
Springer
It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can b...