8413 search results - page 267 / 1683 » Ordering Problem Subgoals |
105
click to vote
MOC
1998
15 years 2 months ago
1998
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
127
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
109
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
121
click to vote
WIA
2009
Springer
15 years 9 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.