CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dance video is one of the important types of narrative videos with semantic rich content. This paper proposes a new meta model, Dance Video Content Model (DVCM) to represent the ex...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Background: Articles whose authors have supplemented subscription-based access to the publisher's version by selfarchiving their own final draft to make it accessible free fo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Increasing numbers of mobile computing devices, user-portable, or embedded in vehicles, cargo containers, or the physical space, need to be aware of their location in order to prov...