Sciweavers

2736 search results - page 528 / 548
» Understanding programmer language
Sort
View
CHI
2006
ACM
15 years 10 months ago
Participatory design with proxies: developing a desktop-PDA system to support people with aphasia
In this paper, we describe the design and preliminary evaluation of a hybrid desktop-handheld system developed to support individuals with aphasia, a disorder which impairs the ab...
Jordan L. Boyd-Graber, Sonya S. Nikolova, Karyn Mo...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICALP
2009
Springer
15 years 10 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
SIGMOD
2009
ACM
122views Database» more  SIGMOD 2009»
15 years 9 months ago
Finding min-repros in database software
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
Nicolas Bruno, Rimma V. Nehme
PODS
2008
ACM
178views Database» more  PODS 2008»
15 years 9 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel