Sciweavers

797 search results - page 144 / 160
» Eliminating Proofs from Programs
Sort
View
BMCBI
2007
134views more  BMCBI 2007»
13 years 10 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 9 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
PLDI
2011
ACM
13 years 20 days ago
Automated atomicity-violation fixing
Fixing software bugs has always been an important and timeconsuming process in software development. Fixing concurrency bugs has become especially critical in the multicore era. H...
Guoliang Jin, Linhai Song, Wei Zhang, Shan Lu, Ben...
IPPS
2009
IEEE
14 years 4 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
FOCS
2007
IEEE
14 years 4 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...