Sciweavers

683 search results - page 136 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
JUCS
2010
160views more  JUCS 2010»
13 years 3 months ago
LCP-Nets: A Linguistic Approach for Non-functional Preferences in a Semantic SOA Environment
Abstract: This paper addresses the problem of expressing preferences among nonfunctional properties of services in a Web service architecture. In such a context, semantic and non-f...
Pierre Châtel, Isis Truck, Jacques Malenfant
AAAI
2011
12 years 5 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 5 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
AAAI
1998
13 years 6 months ago
Qualitative Analysis of Distributed Physical Systems with Applications to Control Synthesis
Manyimportant physical phenomena,such as temperature distribution, air flow, and acoustic waves,are describedas continuous,distributed parameterfields. Analyzingandcontrolling the...
Christopher Bailey-Kellogg, Feng Zhao
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård