5115 search results - page 150 / 1023 » On Randomized Lanczos Algorithms |
179
click to vote
CIKM
2007
Springer
16 years 17 days ago
2007
Springer
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...
176
click to vote
EMMCVPR
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
176
click to vote
TON
2002
15 years 6 months ago
2002
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
245
click to vote
CSR
2011
Springer
14 years 10 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
180
click to vote
SODA
1993
ACM
15 years 7 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.