Sciweavers

2266 search results - page 321 / 454
» Generalizing parametric timing analysis
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 7 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
14 years 7 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
PEPM
2010
ACM
14 years 7 months ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson
IUI
2009
ACM
14 years 7 months ago
User-oriented document summarization through vision-based eye-tracking
We propose a new document summarization algorithm which is personalized. The key idea is to rely on the attention (reading) time of individual users spent on single words in a doc...
Songhua Xu, Hao Jiang, Francis C. M. Lau
CSCW
2010
ACM
14 years 7 months ago
API peer reviews: a method for evaluating usability of application programming interfaces
API usability tests in the lab are time and resource intensive, thus allowing a relatively small percentage of the API namespace to be evaluated. We describe a group-based usabili...
Umer Farooq, Dieter Zirkler