Sciweavers

306 search results - page 43 / 62
» Fault-Tolerant Computation in the Full Information Model
Sort
View
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 10 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
EMSOFT
2006
Springer
13 years 11 months ago
Time-triggered implementations of dynamic controllers
Bridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control sy...
Truong Nghiem, George J. Pappas, Rajeev Alur, Anto...
PODS
2004
ACM
158views Database» more  PODS 2004»
14 years 8 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
WPES
2003
ACM
14 years 1 months ago
Policy migration for sensitive credentials in trust negotiation
Trust negotiation is an approach to establishing trust between strangers through the bilateral, iterative disclosure of digital credentials. Under automated trust negotiation, acc...
Ting Yu, Marianne Winslett
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...