1688 search results - page 147 / 338 » The Complexity of Rationalizing Matchings |
158
click to vote
MICCAI
2002
Springer
16 years 6 months ago
2002
Springer
We propose to match a labeled mesh onto the patient brain surface in a multiresolution way for labeling the patient brain. Labeling the patient brain surface provides a map of the ...
133
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
136
click to vote
ICIAP
2007
ACM
16 years 6 months ago
2007
ACM
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...
165
click to vote
ICFP
2008
ACM
16 years 5 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
161
click to vote
TAMC
2009
Springer
16 years 13 days ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...