Sciweavers

14382 search results - page 2774 / 2877
» Time in Connectionist Models
Sort
View
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 3 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
ACMDIS
2004
ACM
14 years 3 months ago
Making tea: iterative design through analogy
The success of translating an analog or manual practice into a digital interactive system may depend on how well that translation captures not only the functional what and how asp...
Monica M. C. Schraefel, Gareth V. Hughes, Hugo R. ...
AFRIGRAPH
2004
ACM
14 years 3 months ago
Visualizing 3D scenes using non-linear projections and data mining of previous camera movements
We describe techniques for exploring 3D scenes by combining non-linear projections with the interactive data mining of camera navigations from previous explorations. Our approach ...
Karan Singh, Ravin Balakrishnan
ASPLOS
2004
ACM
14 years 3 months ago
Low-overhead memory leak detection using adaptive statistical profiling
Sampling has been successfully used to identify performance optimization opportunities. We would like to apply similar techniques to check program correctness. Unfortunately, samp...
Matthias Hauswirth, Trishul M. Chilimbi
CASES
2004
ACM
14 years 3 months ago
High-level power analysis for on-chip networks
As on-chip networks become prevalent in multiprocessor systemson-a-chip and multi-core processors, they will be an integral part of the design flow of such systems. With power in...
Noel Eisley, Li-Shiuan Peh
« Prev « First page 2774 / 2877 Last » Next »