Sciweavers

4940 search results - page 756 / 988
» On the Complexity of Universal Programs
Sort
View
JCP
2006
91views more  JCP 2006»
15 years 6 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
ENTCS
2007
112views more  ENTCS 2007»
15 years 6 months ago
A Calculus of Global Interaction based on Session Types
This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. ...
Marco Carbone, Kohei Honda, Nobuko Yoshida
TKDE
2008
121views more  TKDE 2008»
15 years 6 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
JDS
2007
104views more  JDS 2007»
15 years 6 months ago
Operational Risk Management How an I-DSS May Help
Operational Risk management, the least covered component of Enterprise Wide Risk Management, needs intelligent tools to implement Comprehensive Emergency Management Programs. In t...
Pedro A. C. Sousa, João Paulo Pimentã...
JUCS
2007
104views more  JUCS 2007»
15 years 6 months ago
Achieving Atomicity for Web Services Using Commutativity of Actions
: Web Services enable the creation of complex business activities through the cooperation of independently developed software programs. However, Web Services incur the risk of long...
P. Michael Melliar-Smith, Louise E. Moser