Sciweavers

9931 search results - page 1723 / 1987
» Generative Modeling by PRISM
Sort
View
SPAA
1994
ACM
15 years 8 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ACMACE
2007
ACM
15 years 8 months ago
Application of dimensionality reduction techniques to HRTFS for interactive virtual environments
Fundamental to the generation of 3D audio is the HRTF processing of acoustical signals. Unfortunately, given the high dimensionality of HRTFs, incorporating them into dynamic/inte...
Bill Kapralos, Nathan Mekuz
AOSD
2007
ACM
15 years 8 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
118
Voted
AOSD
2007
ACM
15 years 8 months ago
A flexible architecture for pointcut-advice language implementations
Current implementations for aspect-oriented programming languages map the aspect-oriented concepts of source programs to object-oriented bytecode. This hinders execution environme...
Christoph Bockisch, Mira Mezini
APGV
2007
ACM
104views Visualization» more  APGV 2007»
15 years 8 months ago
On the empirical limits of billboard rotation
This paper describes an experiment investigating for the first time, the perceptual tolerance of inconsistent projections when rotated billboards are transformed and included in a...
Elodie Fourquet, William Cowan, Stephen Mann
« Prev « First page 1723 / 1987 Last » Next »