1301 search results - page 89 / 261 » Bounded Version Vectors |
184
Voted
WAW
2010
Springer
15 years 1 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
123
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
134
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
110
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
149
Voted
ICDAR
2009
IEEE
15 years 10 months ago
2009
IEEE
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...