588 search results - page 118 / 118 » Reducibility and Completeness in Private Computations |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
BMCBI
2010
13 years 5 months ago
2010
Background: Microarray experiments have become very popular in life science research. However, if such experiments are only considered independently, the possibilities for analysi...
MOBISYS
2009
ACM
14 years 5 months ago
2009
ACM
Point&Connect (P&C) offers an intuitive and resilient device pairing solution on standard mobile phones. Its operation follows the simple sequence of point-and-connect: wh...