Sciweavers

144 search results - page 22 / 29
» Running time and program size for self-assembled squares
Sort
View
OOPSLA
2004
Springer
14 years 23 days ago
Finding and preventing run-time error handling mistakes
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
Westley Weimer, George C. Necula
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 7 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
IPPS
2003
IEEE
14 years 21 days ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
BMCBI
2010
126views more  BMCBI 2010»
13 years 7 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
IPPS
2009
IEEE
14 years 2 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba