Sciweavers

619 search results - page 38 / 124
» Generic Extensions and Generic Polynomials
Sort
View
APAL
2008
83views more  APAL 2008»
13 years 7 months ago
Easton's theorem and large cardinals
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Sy D. Friedman, Radek Honzik
MMS
2002
13 years 7 months ago
A retrospective on the design of the GOPI middleware platform
This paper offers a high-level retrospective overview of the GOPI middleware platform which is the outcome of a three year project aimed at the development of generic, configurabl...
Geoff Coulson, Shakuntala Baichoo, Oveeyen Moonian
CVPR
2008
IEEE
14 years 9 months ago
Taylor expansion based classifier adaptation: Application to person detection
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
Cha Zhang, Raffay Hamid, Zhengyou Zhang
DLT
2008
13 years 9 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
FLAIRS
2003
13 years 9 months ago
Meta-S: A Strategy-Oriented Meta-Solver Framework
Meta-S is a practical implementation and extension of the theoretical framework developed by Hofstedt, which allows the user to attack problems requiring the cooperation of arbitr...
Stephan Frank, Petra Hofstedt, Pierre R. Mai