Sciweavers

221 search results - page 33 / 45
» Twinkle: programming with color
Sort
View
SIGGRAPH
1998
ACM
15 years 2 months ago
A Perceptually Based Adaptive Sampling Algorithm
A perceptually based approach for selecting image samples has been developed. An existing image processing vision model has been extended to handle color and has been simplified ...
Mark R. Bolin, Gary W. Meyer
IWPSE
2005
IEEE
15 years 3 months ago
EvoLens: Lens-View Visualizations of Evolution Data
Visualizing software evolution is essential for identifying design erosions that have occurred over the past releases. Making evolutionary aspects explicit via visual representati...
Jacek Ratzinger, Michael Fischer, Harald Gall
69
Voted
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
ADHOCNOW
2004
Springer
15 years 3 months ago
Analysis of the Information Propagation Time Among Mobile Hosts
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...
RSA
2008
123views more  RSA 2008»
14 years 9 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang