Sciweavers

1604 search results - page 65 / 321
» Regularization on Discrete Spaces
Sort
View
LSSC
2001
Springer
15 years 7 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
SIGGRAPH
1989
ACM
15 years 7 months ago
Algorithms for solid noise synthesis
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...
J. P. Lewis
SIGCOMM
2006
ACM
15 years 9 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
INFOCOM
2011
IEEE
14 years 7 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
SCL
2011
14 years 6 months ago
Regularity issues for the null-controllability of the linear 1-d heat equation
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
Sorin Micu, Enrique Zuazua