Sciweavers

3680 search results - page 138 / 736
» cases 2010
Sort
View
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
15 years 10 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 8 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
15 years 7 months ago
Reconstructing Randomized Social Networks
In social networks, nodes correspond to entities and edges to links between them. In most of the cases, nodes are also associated with a set of features. Noise, missing values or ...
Niko Vuokko, Evimaria Terzi
ATAL
2010
Springer
15 years 7 months ago
Characterising and matching iterative and recursive agent interaction protocols
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
Tim Miller, Peter McBurney
CONCUR
2010
Springer
15 years 7 months ago
Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis
Abstract. In this paper we introduce a real-time extension of the concurrent object modeling language Creol which is based on duration statements indicating best and worst case exe...
Frank S. de Boer, Mohammad Mahdi Jaghoori, Einar B...