2924 search results - page 288 / 585 » Lower Bounds in Distributed Computing |
174
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
160
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
145
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
135
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
159
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...