Sciweavers

2911 search results - page 264 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
ISCI
2008
93views more  ISCI 2008»
15 years 6 months ago
Safety, domain independence and translation of complex value database queries
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
Hong-Cheu Liu, Jeffrey Xu Yu, Weifa Liang
154
Voted
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 6 months ago
Enrichment of Qualitative Beliefs for Reasoning under Uncertainty
– This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic label...
Xinde Li, Xinhan Huang, Florentin Smarandache, Jea...
CORR
1998
Springer
103views Education» more  CORR 1998»
15 years 6 months ago
The descriptive complexity approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
Clemens Lautemann, Pierre McKenzie, Thomas Schwent...
OOPSLA
2010
Springer
15 years 5 months ago
The two-state solution: native and serializable continuations accord
Continuation-based Web servers provide advantages over traditional Web application development through the increase of expressive power they allow. This leads to fewer errors and ...
Jay A. McCarthy