Sciweavers

844 search results - page 122 / 169
» More On Implicit Syntax
Sort
View
108
Voted
FSS
2008
127views more  FSS 2008»
15 years 26 days ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
JCC
2008
111views more  JCC 2008»
15 years 23 days ago
Highly accurate biomolecular electrostatics in continuum dielectric environments
: Implicit solvent models based on the Poisson-Boltzmann (PB) equation are frequently used to describe the interactions of a biomolecule with its dielectric continuum environment. ...
Y. C. Zhou, Michael Feig, G. W. Wei
JMLR
2006
124views more  JMLR 2006»
15 years 23 days ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
ENTCS
2007
137views more  ENTCS 2007»
15 years 23 days ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
100
Voted
JSS
2006
77views more  JSS 2006»
15 years 23 days ago
Recovering architectural assumptions
During the creation of a software architecture, the architects and stakeholders take a lot of decisions. Many of these decisions can be directly related to functional or quality r...
Ronny Roeller, Patricia Lago, Hans van Vliet