Browse by Subject "computer science"
Now showing items 215-222 of 222
(2007-10)Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E = \Delta \uplus B with B a set of axioms for which a finitary unification algorithm exists, and \Delta a set ...
(2009-03)For narrowing with a set of rules \Delta modulo a set of axioms B almost nothing is known about terminating narrowing strategies, and basic narrowing is known to be incomplete for B=AC. In this work we ask and answer the ...
(2006-05)Both the measurement and simulation of unsteady flow yield huge datasets of time-varying volumetric vector fields. Flow dynamics researchers face the very difficult task of finding, extracting and analyzing important flow ...
(2006-02)The lack of available identity information in attribute-based trust management systems complicates the design of the audit and incident response systems, anomaly detection algorithms, collusion detection/prevention mechanisms, ...
(iSchools, 3/15/16)This poster presents preliminary results for examining computer science communities based on Twitter conference hashtags such as #iconference2016. We construct and visualize a computer science conference network based on ...
(2008-12)In face-to-face group situations, social pressure and organizational hierarchy relegate the less outspoken into silence, often resulting in fewer voices, fewer ideas, and group-think. However, in mediated interaction, such ...
(2008-10)In large software projects often multiple modeling languages are used in order to cover the different domains and views of the application and the language skills of the developers appropriately. Such "multi-modeling" ...
(2004-08)Microprocessor design complexity is growing rapidly. As a result, current development costs for top of the line processors are staggering, and are doubling every 4 years. As we design ever larger and more complex processors, ...