Sciweavers

4372 search results - page 305 / 875
» Algorithmic Theories of Everything
Sort
View
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
15 years 7 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
ESANN
2000
15 years 7 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...
147
Voted
CGF
2008
114views more  CGF 2008»
15 years 6 months ago
Real-time Shading with Filtered Importance Sampling
We propose an analysis of numerical integration based on sampling theory, whereby the integration error caused by aliasing is suppressed by pre-filtering. We derive a pre-filter f...
Jaroslav Krivánek, Mark Colbert
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 6 months ago
Sensing Danger: Innate Immunology for Intrusion Detection
The immune system provides an ideal metaphor for anomaly detection in general and computer security in particular. Based on this idea, artificial immune systems have been used for...
Uwe Aickelin, Julie Greensmith
JMLR
2006
107views more  JMLR 2006»
15 years 6 months ago
Consistency of Multiclass Empirical Risk Minimization Methods Based on Convex Loss
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
Di-Rong Chen, Tao Sun