Sciweavers

1732 search results - page 50 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
CSL
2005
Springer
15 years 11 months ago
On Deciding Topological Classes of Deterministic Tree Languages
Abstract. It has been proved by Niwi´nski and Walukiewicz that a deterministic tree language is either Π1 1 -complete or it is on the level Π0 3 of the Borel hierarchy, and that...
Filip Murlak
MICRO
2007
IEEE
120views Hardware» more  MICRO 2007»
16 years 14 days ago
Scavenger: A New Last Level Cache Architecture with Global Block Priority
Addresses suffering from cache misses typically exhibit repetitive patterns due to the temporal locality inherent in the access stream. However, we observe that the number of inte...
Arkaprava Basu, Nevin Kirman, Meyrem Kirman, Maina...
BMCBI
2005
201views more  BMCBI 2005»
15 years 6 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota
DM
2008
101views more  DM 2008»
15 years 6 months ago
Congruences involving Bernoulli polynomials
Let {Bn(x)} be the Bernoulli polynomials. In the paper we establish some congruences for Bj(x) (mod pn), where p is an odd prime and x is a rational p-integer. Such congruences are...
Zhi-Hong Sun
BMCBI
2007
100views more  BMCBI 2007»
15 years 6 months ago
Discovering structural motifs using a structural alphabet: Application to magnesium-binding sites
Background: For many metalloproteins, sequence motifs characteristic of metal-binding sites have not been found or are so short that they would not be expected to be metal-specifi...
Minko Dudev, Carmay Lim