2239 search results - page 229 / 448 » Computing with abstract matrix structures |
103
Voted
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Traditional code optimization techniques treat loops as nonpredictable structures and do not consider expressions containing array accesses for optimization. We show that...
116
Voted
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
135
Voted
ERSHOV
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Research in dialogue systems has been moving towards reusable and adaptable architectures for managing dialogue execution and integrating heterogeneous subsystems. In thi...
126
Voted
FCT
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
130
Voted
PDPTA
2000
15 years 5 months ago
2000
Abstract We describe an event-based, publishand-subscribe system based on using "smart subscriptions" to recognize weakly structured events. We present a hierarchy of sub...