9997 search results - page 1737 / 2000 » The case for crowd computing |
281
click to vote
ISCA
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
175
click to vote
JCISE
2002
15 years 6 months ago
2002
An ideal product modeling system should support both part modeling and assembly modeling, instead of just either of them as is the case in most current CAD systems. A good basis f...
201
click to vote
PR
2007
15 years 6 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
148
click to vote
PR
2007
15 years 6 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
190
click to vote
RE
2008
Springer
15 years 6 months ago
2008
Springer
For several decades there has been a debate in the computing sciences about the relative roles of design and empirical research, and about the contribution of design and research ...