Sciweavers

12774 search results - page 2349 / 2555
» A Framework for Proof Systems
Sort
View
TPDS
2002
126views more  TPDS 2002»
15 years 6 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
TSMC
2002
156views more  TSMC 2002»
15 years 6 months ago
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
M. A. L. Thathachar, P. Shanti Sastry
TVLSI
2002
130views more  TVLSI 2002»
15 years 6 months ago
HW/SW codesign techniques for dynamically reconfigurable architectures
Abstract--Hardward/software (HW/SW) codesign and reconfigurable computing are commonly used methodologies for digitalsystems design. However, no previous work has been carried out ...
Juanjo Noguera, Rosa M. Badia
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 6 months ago
Mathematical Modeling of Competition in Sponsored Search Market
Sponsored search mechanisms have drawn much attention from both academic community and industry in recent years since the seminal papers of [3] and [4]. However, most of the exist...
Jian Liu, Dah Ming Chiu
ML
2007
ACM
144views Machine Learning» more  ML 2007»
15 years 6 months ago
Invariant kernel functions for pattern analysis and machine learning
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
Bernard Haasdonk, Hans Burkhardt
« Prev « First page 2349 / 2555 Last » Next »