Sciweavers

484 search results - page 3 / 97
» Large graph processing in the cloud
Sort
View
CCGRID
2011
IEEE
14 years 3 months ago
Improving Utilization of Infrastructure Clouds
— A key advantage of Infrastructure-as-a-Service (IaaS) clouds is providing users on-demand access to resources. However, to provide on-demand access, cloud providers must either...
Paul Marshall, Kate Keahey, Timothy Freeman
TVCG
2010
141views more  TVCG 2010»
14 years 10 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
114
Voted
CAD
2007
Springer
14 years 11 months ago
Detection of closed sharp edges in point clouds using normal estimation and graph theory
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
Kris Demarsin, Denis Vanderstraeten, Tim Volodine,...
HPDC
2010
IEEE
14 years 11 months ago
A perspective on scientific cloud computing
Cloud computing has the potential for tremendous benefits, but wide scale adoption has a range of challenges that must be met. We review these challenges and how they relate to sc...
Craig A. Lee
108
Voted
PVLDB
2008
216views more  PVLDB 2008»
14 years 10 months ago
Ad-hoc data processing in the cloud
Ad-hoc data processing has proven to be a critical paradigm for Internet companies processing large volumes of unstructured data. However, the emergence of cloud-based computing, ...
Dionysios Logothetis, Ken Yocum