Sciweavers

1265 search results - page 156 / 253
» Finding the Key to a Synapse
Sort
View
COR
2010
146views more  COR 2010»
13 years 9 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
CGF
2008
101views more  CGF 2008»
13 years 9 months ago
A Prism-Free Method for Silhouette Rendering in Inverse Displacement Mapping
Silhouette is a key feature that distinguishes displacement mapping from normal mapping. However the silhouette rendering in the GPU implementation of displacement mapping (which ...
Ying-Chieh Chen, Chun-Fa Chang
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 9 months ago
Is It Real, or Is It Randomized?: A Financial Turing Test
We construct a financial "Turing test" to determine whether human subjects can differentiate between actual vs. randomized financial returns. The experiment consists of ...
Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola
COMCOM
2008
131views more  COMCOM 2008»
13 years 9 months ago
CORA: Collaborative Opportunistic Recovery Algorithm for loss controlled, delay bounded ad hoc multicast
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
Yunjung Yi, Jiejun Kong, Mario Gerla, Joon-Sang Pa...
COR
2008
97views more  COR 2008»
13 years 9 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...