8838 search results - page 328 / 1768 » Generalizing Domain Theory |
153
click to vote
APAL
2005
15 years 6 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
206
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
176
click to vote
IWANN
2001
Springer
15 years 11 months ago
2001
Springer
A novel approach to calculate the generalization error of the support vector machines and a new support vector machine–nonsymmatic support vector machine–is proposed here. Our ...
159
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
148
click to vote
ADCM
2000
15 years 6 months ago
2000
We present a concrete method to build discrete biorthogonal systems such that the wavelet filters have any number of vanishing moments. Several algorithms are proposed to construct...