Sciweavers

583 search results - page 23 / 117
» Finding Answers to Complex Questions
Sort
View
BMCBI
2008
71views more  BMCBI 2008»
13 years 7 months ago
A tale of two symmetrical tails: Structural and functional characteristics of palindromes in proteins
Background: It has been previously shown that palindromic sequences are frequently observed in proteins. However, our knowledge about their evolutionary origin and their possible ...
Armita Sheari, Mehdi Kargar, Ali Katanforoush, Sha...
CCS
2010
ACM
13 years 8 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
FSTTCS
2001
Springer
14 years 6 days ago
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
Eric Allender
COCOON
2003
Springer
14 years 28 days ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz