Sciweavers

2656 search results - page 49 / 532
» A general purpose animator
Sort
View
CACM
2000
97views more  CACM 2000»
13 years 7 months ago
Generalizing by Removing Detail
A long-standing goal of the programming by demonstration research community is to enable people to construct programs by showing how the desired programs should work on sample inp...
Kenneth M. Kahn
COMBINATORICS
2000
94views more  COMBINATORICS 2000»
13 years 7 months ago
A Determinant of the Chudnovskys Generalizing the Elliptic Frobenius-Stickelberger-Cauchy Determinantal Identity
Abstract. D.V. Chudnovsky and G.V. Chudnovsky [CH] introduced a generalization of the FrobeniusStickelberger determinantal identity involving elliptic functions that generalize the...
Tewodros Amdeberhan
TWC
2010
13 years 2 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
ICC
2009
IEEE
144views Communications» more  ICC 2009»
14 years 2 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim
SIGGRAPH
2000
ACM
14 years 19 hour ago
Adaptively sampled distance fields: a general representation of shape for computer graphics
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
Sarah F. Frisken Gibson, Ronald N. Perry, Alyn P. ...