5499 search results - page 357 / 1100 » Generalized Rewrite Theories |
179
Voted
CCA
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. General methods of investigating effectivity on regular Hausdorff (T3) spaces is considered. It is shown that there exists a functor from a category of T3 spaces into a c...
187
Voted
ICALP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
256
click to vote
UMC
2000
15 years 11 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
190
click to vote
AAAI
2007
15 years 9 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
202
Voted
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...