1017 search results - page 60 / 204 » Some existence and construction results of polygonal designs |
168
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: The determination of protein surfaces and the detection of binding sites are essential to our understanding of protein-protein interactions. Such binding sites can be ...
166
click to vote
ICASSP
2009
IEEE
16 years 28 days ago
2009
IEEE
In this paper we model the components of the compressive sensing (CS) problem using the Bayesian framework by utilizing a hierarchical form of the Laplace prior to model sparsity ...
147
click to vote
MFCS
2007
Springer
16 years 10 days ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
164
click to vote
CALCO
2005
Springer
15 years 11 months ago
2005
Springer
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
132
click to vote
WSC
2004
15 years 7 months ago
2004
Calvin and Nakayama previously introduced permuting as a way of improving existing standardized time series methods. The basic idea is to split a simulated sample path into nonove...