Sciweavers

4218 search results - page 141 / 844
» Complete sets of cooperations
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 5 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
PPDP
2009
Springer
14 years 4 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
IPL
2008
129views more  IPL 2008»
13 years 10 months ago
Parameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
JAR
2006
81views more  JAR 2006»
13 years 10 months ago
Verifying the SET Purchase Protocols
SET (Secure Electronic Transaction) is a suite of protocols proposed by a consortium of credit card companies and software corporations to secure ecommerce transactions. The Purcha...
Giampaolo Bella, Fabio Massacci, Lawrence C. Pauls...
ACS
2004
13 years 10 months ago
One Setting for All: Metric, Topology, Uniformity, Approach Structure
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
Maria Manuel Clementino, Dirk Hofmann, Walter Thol...