1813 search results - page 287 / 363 » Instance Pruning Techniques |
158
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
159
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
174
click to vote
DAS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Training and evaluation of techniques for handwriting recognition and retrieval is a challenge given that it is difficult to create large ground-truthed datasets. This is...
137
click to vote
EWCBR
2006
Springer
15 years 8 months ago
2006
Springer
The design of a CBR system involves the use of similarity metrics. For many applications, various functions can be adopted to compare case features and to aggregate them into a glo...
133
click to vote
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...