Sciweavers

3179 search results - page 131 / 636
» Applications of PCF Theory
Sort
View
JSSPP
1998
Springer
14 years 2 months ago
Predicting Application Run Times Using Historical Information
We present a technique for deriving predictions for the run times of parallel applications from the run times of "similar" applications that have executed in the past. T...
Warren Smith, Ian T. Foster, Valerie E. Taylor
ITICSE
2006
ACM
14 years 4 months ago
Fast application development to demonstrate computer graphics concepts
Computer graphics concepts have a high visual component. For that reason, teaching this subject should be enriched with the use of small applications showing concepts like near an...
Pedro Pablo Gómez-Martín, Marco Anto...
HIPC
2005
Springer
14 years 3 months ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra
AAAI
2008
14 years 11 days ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
SMA
2008
ACM
136views Solid Modeling» more  SMA 2008»
13 years 10 months ago
Kinematic convexity of spherical displacements and its application to collision prediction
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
Qiaode Jeffrey Ge, Anurag Purwar, Jun Wu