Sciweavers

1055 search results - page 143 / 211
» Enumerations in computable structure theory
Sort
View
PC
2006
103views Management» more  PC 2006»
13 years 10 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 10 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
MSCS
2007
91views more  MSCS 2007»
13 years 9 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
CHI
2008
ACM
14 years 10 months ago
A resource kit for participatory socio-technical design in rural Kenya
We describe our approach and initial results in the participatory design of technology relevant to local rural livelihoods. Our approach to design and usability proceeds from rese...
Kevin Walker, Joshua Underwood, Timothy Mwololo Wa...
CHI
2010
ACM
14 years 5 months ago
Multi-lifespan information system design: a research initiative for the hci community
This CHI Note proposes a new research initiative for the HCI community: multi-lifespan information system design. The central idea begins with the identification of categories of ...
Batya Friedman, Lisa P. Nathan