1145 search results - page 25 / 229 » Discrete Green's Functions |
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good resu...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
We approached the problem as learning how to order documents by estimated relevance with respect to a user query. Our support vector machines based classifier learns from the rele...
59
Voted
IV
1999
IEEE
15 years 1 months ago
1999
IEEE
In Computer Graphics, aliasing is a problem which is always present when discrete elements are mapped to continuous functions or vice-versa. Although there is no general solution ...
MOC
2002
14 years 9 months ago
2002
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...
ICIAR
2007
Springer
15 years 3 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...