Sciweavers

1923 search results - page 99 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
ACL
2010
14 years 7 months ago
Exemplar-Based Models for Word Meaning in Context
This paper describes ongoing work on distributional models for word meaning in context. We abandon the usual one-vectorper-word paradigm in favor of an exemplar model that activat...
Katrin Erk, Sebastian Padó
WPES
2003
ACM
15 years 3 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
NIPS
2007
14 years 11 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
ICS
2010
Tsinghua U.
15 years 2 months ago
Overlapping communication and computation by using a hybrid MPI/SMPSs approach
– Communication overhead is one of the dominant factors that affect performance in high-performance computing systems. To reduce the negative impact of communication, programmers...
Vladimir Marjanovic, Jesús Labarta, Eduard ...