Sciweavers

11211 search results - page 1847 / 2243
» Data Structures
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
IFIPPACT
1994
15 years 8 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
ADCM
2008
136views more  ADCM 2008»
15 years 7 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
CGF
2008
262views more  CGF 2008»
15 years 7 months ago
Global Correspondence Optimization for Non-Rigid Registration of Depth Scans
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
Hao Li, Robert W. Sumner, Mark Pauly
IGARSS
2010
15 years 4 months ago
Lidar education at Georgia Tech
The Georgia Tech Research Institute teamed with a local undergraduate women's institution, Agnes Scott College, to develop an eyesafe lidar for atmospheric remote sensing as ...
Gary Gimmestad, Leanne West
« Prev « First page 1847 / 2243 Last » Next »