9997 search results - page 235 / 2000 » The case for crowd computing |
138
click to vote
APL
1998
ACM
15 years 10 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
131
click to vote
DAGSTUHL
2010
15 years 7 months ago
2010
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for ...
138
click to vote
VMV
2008
15 years 7 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
185
click to vote
IANDC
2007
15 years 6 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
155
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...