Sciweavers

903 search results - page 45 / 181
» Non-well-founded trees in categories
Sort
View
116
Voted
ISCA
2011
IEEE
229views Hardware» more  ISCA 2011»
14 years 5 months ago
TLSync: support for multiple fast barriers using on-chip transmission lines
As the number of cores on a single-chip grows, scalable barrier synchronization becomes increasingly difficult to implement. In software implementations, such as the tournament ba...
Jungju Oh, Milos Prvulovic, Alenka G. Zajic
ATAL
2011
Springer
14 years 1 months ago
Multi-criteria argument selection in persuasion dialogues
The main goal of a persuasion dialogue is to persuade, but agents may have a number of additional goals concerning the dialogue duration, how much and what information is shared o...
Thomas L. van der Weide, Frank Dignum, John-Jules ...
EGH
2011
Springer
14 years 1 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 2 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ACMSE
2006
ACM
15 years 8 months ago
Framework design using function generalization: a binary tree traversal case study
A software framework is a technology that enables software reuse, potentially yielding rich dividends but requiring significant longterm investment. However, a framework is not a ...
H. Conrad Cunningham, Yi Liu, Pallavi Tadepalli