9325 search results - page 1769 / 1865 » The decentralized implementability problem |
137
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
149
click to vote
DEXA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
105
Voted
ECOOP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this paper we present Jam, an extension of the Java language supporting mixins, that is, parametric heir classes. A mixin declaration in Jam is similar to a Java heir ...
130
Voted
ICFP
1999
ACM
15 years 7 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
119
click to vote
SIGCOMM
1999
ACM
15 years 7 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...