5115 search results - page 854 / 1023 » On Randomized Lanczos Algorithms |
164
click to vote
COCO
2009
Springer
16 years 24 days ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
153
click to vote
CPM
2009
Springer
16 years 24 days ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
170
click to vote
GECCO
2009
Springer
16 years 24 days ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
140
click to vote
ICB
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. Sweat pores on fingerprints have proven to be useful features for personal identification. Several methods have been proposed for pore matching. The state-of-the-art meth...
178
click to vote
IDA
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. Accurately evaluating statistical independence among random variables is a key component of Independent Component Analysis (ICA). In this paper, we employ a squared-loss ...