Sciweavers

793 search results - page 144 / 159
» Efficient computation of the characteristic polynomial
Sort
View
BMCBI
2008
129views more  BMCBI 2008»
13 years 7 months ago
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes
Background: Bacterial promoters, which increase the efficiency of gene expression, differ from other promoters by several characteristics. This difference, not yet widely exploite...
Michael Dekhtyar, Amelie Morin, Vehary Sakanyan
WIOPT
2010
IEEE
13 years 5 months ago
Flunet: Automated tracking of contacts during flu season
— By analyzing people’s contact patterns over time, it is possible to build efficient delay tolerant networking (DTN) algorithms and derive important data for parameterizing an...
Mohammad S. Hashemian, Kevin G. Stanley, Nathaniel...
POPL
2005
ACM
14 years 7 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
MOBIHOC
2007
ACM
14 years 7 months ago
Cross-layer latency minimization in wireless networks with SINR constraints
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...