984 search results - page 90 / 197 » ideas 2010 |
104
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
105
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
107
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
CSCW
2010
ACM
15 years 10 months ago
2010
ACM
It would be useful if software engineers/instructors could be aware that remote team members/students are having difficulty with their programming tasks. We have developed an appr...
121
click to vote
SAC
2010
ACM
15 years 7 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...