5115 search results - page 721 / 1023 » On Randomized Lanczos Algorithms |
162
click to vote
APPROX
2005
Springer
16 years 2 days ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
183
click to vote
PKDD
2005
Springer
16 years 10 hour ago
2005
Springer
Abstract. We describe work aimed at cost-constrained knowledge discovery in the biomedical domain. To improve the diagnostic/prognostic models of cancer, new biomarkers are studied...
226
click to vote
SIGIR
2004
ACM
15 years 12 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
136
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
173
click to vote
ESWS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...