Sciweavers

893 search results - page 18 / 179
» Descent Theory for Schemes
Sort
View
83
Voted
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 6 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
MKM
2007
Springer
15 years 5 months ago
Biform Theories in Chiron
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
William M. Farmer
CSE
2009
IEEE
15 years 3 months ago
Extended Dempster-Shafer Theory in Context Reasoning for Ubiquitous Computing Environments
—Context, the pieces of information that capture the characteristics of ubiquitous computing environment, is often imprecise and incomplete due to user mobility, unreliable wirel...
Daqiang Zhang, Jiannong Cao, Jingyu Zhou, Minyi Gu...
ECCV
2006
Springer
15 years 3 months ago
Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm
We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (lowresolution) im...
Hui Ji, Cornelia Fermüller
TSP
2008
117views more  TSP 2008»
14 years 11 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do