2681 search results - page 147 / 537 » Problem F |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
TALG
2008
13 years 10 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
SIGIR
2011
ACM
13 years 1 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
SIAMSC
2008
13 years 10 months ago
2008
In this note we consider the numerical solution of selfadjoint deblurring problems on bounded intervals. For these problems it has recently been shown that appropriate modelling of...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...