1145 search results - page 77 / 229 » Discrete Green's Functions |
182
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
173
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
173
click to vote
SIAMREV
2010
15 years 1 months ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
168
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...
166
click to vote
CVPR
1997
IEEE
15 years 10 months ago
1997
IEEE
Grouping based on common motion, or “common fate” provides a powerful cue for segmenting image sequences. Recently a number of algorithms have been developed that successfully...