Sciweavers

221 search results - page 14 / 45
» Analyzing the Implicit Computational Complexity of object-or...
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
15 years 10 months ago
Can complex network metrics predict the behavior of NBA teams?
The United States National Basketball Association (NBA) is one of the most popular sports league in the world and is well known for moving a millionary betting market that uses th...
Antonio Alfredo Ferreira Loureiro, Pedro O. S. Vaz...
SIGSOFT
2010
ACM
14 years 7 months ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan
COMPUTING
2011
14 years 4 months ago
Cloud computing for small research groups in computational science and engineering: current status and outlook
Abstract Cloud computing could offer good business models for small CSE (Computational Science and Engineering) research groups because these groups often do not have enough human ...
Hong Linh Truong, Schahram Dustdar
76
Voted
IPPS
2008
IEEE
15 years 4 months ago
Parallel performance wizard: A performance analysis tool for partitioned global-address-space programming
Given the complexity of parallel programs, developers often must rely on performance analysis tools to help them improve the performance of their code. While many tools support th...
Hung-Hsun Su, Max Billingsley, Alan D. George