1503 search results - page 220 / 301 » Self-optimizing distributed trees |
129
Voted
VCHCI
1993
15 years 8 months ago
1993
The interaction history of a document can be modelled as a tree of command objects. This model does not only support recovery (undo/redo), but is also suitable for cooperation betw...
141
click to vote
ICDE
1991
IEEE
15 years 7 months ago
1991
IEEE
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
101
click to vote
NAACL
2007
15 years 5 months ago
2007
The work1 we present here is concerned with the acquisition of deep grammatical information for nouns in Spanish. The aim is to build a learner that can handle noise, but, more in...
107
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
157
click to vote
WIS
2004
15 years 5 months ago
2004
Distributed applications mostly interact by exchanging messages. For this purpose the messages often need to be ordered. Since today more and more mobile devices are used message o...