633 search results - page 10 / 127 » Locality and Hard SAT-Instances |
JMLR
2010
13 years 2 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
SIGCSE
2009
ACM
14 years 8 months ago
2009
ACM
Deaf and hard of hearing students are an underrepresented group in computing and face extra challenges in university-level computing courses. This paper describes a 9-week Summer ...
ICCD
2007
IEEE
14 years 4 months ago
2007
IEEE
Building fully synchronous VLSI circuits is becoming less viable as circuit geometries evolve. However, before the adoption of purely asynchronous strategies in VLSI design, globa...
CHI
2010
ACM
13 years 5 months ago
2010
ACM
Mobile services can provide users with information relevant to their current circumstances. Distant services in turn can acquire local information from people in an area of intere...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...