5726 search results - page 810 / 1146 » Supporting annotations on relations |
161
Voted
CHI
2003
ACM
16 years 7 months ago
2003
ACM
Despite recent advances in natural language question answering technology, the problem of designing effective user interfaces has been largely unexplored. We conducted a user stud...
155
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Many applications require users to specify preferences. We support users in this task by letting them define preferences relative to their personal history or that of other users....
171
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
177
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
172
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...