Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
Abstract: On the background of rising Intranet applications the automatic generation of adaptable, context-sensitive hypertexts becomes more and more important [El-Beltagy et al., ...
Abstract: While the problem of incompletedata in databases has been extensively studied, a relatively unexplored form of uncertainty in databases, called inaccurate data, demands d...
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
Abstract—The adaptive ubiquitous services, which dynamically adapt behaviors to requirements and contexts, are one of the major challenges in the ubiquitous computing. To facilit...