Sciweavers

25041 search results - page 4929 / 5009
» Algorithms for Clustering Data
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ASM
2003
ASM
14 years 2 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer
CICLING
2003
Springer
14 years 2 months ago
An Evaluation of a Lexicographer's Workbench Incorporating Word Sense Disambiguation
NLPsystem developers and corpus lexicographers would both bene t from a tool for nding and organizing the distinctive patterns of use of words in texts. Such a tool would be an ass...
Adam Kilgarriff, Rob Koeling
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 2 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
EUROPAR
2003
Springer
14 years 2 months ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens
« Prev « First page 4929 / 5009 Last » Next »