1522 search results - page 300 / 305 » On the Complexity of Several Haplotyping Problems |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
PLDI
2003
ACM
14 years 2 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
PLDI
2010
ACM
14 years 1 months ago
2010
ACM
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
CP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
SIGMOD
1994
ACM
14 years 26 days ago
1994
ACM
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...