Sciweavers

835 search results - page 77 / 167
» Characterizing rosy theories
Sort
View
CORR
1998
Springer
103views Education» more  CORR 1998»
14 years 11 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...
IJCM
2010
80views more  IJCM 2010»
14 years 10 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
MLQ
2010
226views more  MLQ 2010»
14 years 10 months ago
The Ultrafilter Closure in ZF
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...
Gonçalo Gutierres
CVPR
2005
IEEE
16 years 1 months ago
Generative versus Discriminative Methods for Object Recognition
Many approaches to object recognition are founded on probability theory, and can be broadly characterized as either generative or discriminative according to whether or not the di...
Ilkay Ulusoy, Christopher M. Bishop
VIS
2008
IEEE
137views Visualization» more  VIS 2008»
16 years 1 months ago
Importance-Driven Time-Varying Data Visualization
The ability to identify and present the most essential aspects of time-varying data is critically important in many areas of science and engineering. This paper introduces an impor...
Chaoli Wang, Hongfeng Yu, Kwan-Liu Ma