Stem agreement$ (all stems)

67 papers:

STOC-2015-AbrahamD #complexity #polynomial

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (IA, DD), pp. 605–614.

CHI-2015-VatavuW #analysis #elicitation #formal method #metric #tool support

Formalizing Agreement Analysis for Elicitation Studies: New Measures, Significance Test, and Toolkit (RDV, JOW), pp. 1325–1334.

CAiSE-2015-OrtegaGTRC #modelling #outsourcing #process

Modelling Service Level Agreements for Business Process Outsourcing Services (AdRO, AMG, ADT, MR, ARC), pp. 485–500.

SIGIR-2015-MegorskayaKS #assessment #on the

On the Relation Between Assessor’s Agreement and Accuracy in Gamified Relevance Assessment (OM, VK, PS), pp. 605–614.

SAC-2015-GouthamLY #authentication #protocol #smarttech #using

An anonymous ID-based remote mutual authentication with key agreement protocol on ECC using smart cards (RAG, GJL, KYY), pp. 169–174.

ICEIS-v1-2014-0001DFL #classification #constraints #documentation #process

Service Level Agreement Constraints into Processes for Document Classification (MB, MD, FF, AL), pp. 545–550.

ICEIS-v1-2014-AmorimC #clustering #evaluation

Paired Indices for Clustering Evaluation — Correction for Agreement by Chance (MJA, MGMSC), pp. 164–170.

ICEIS-v3-2014-BarrosFSA #approach #towards

Deriving Service Level Agreements from Business Level Agreements — An Approach Towards Strategic Alignment in Organizations (VAB, MF, GMBS, JPdA), pp. 214–225.

SAC-2014-YoonY #authentication #network #using

A biometric-based authenticated key agreement scheme using ECC for wireless sensor networks (EJY, KYY), pp. 699–705.

STOC-2013-KingS #polynomial

Byzantine agreement in polynomial expected time: [extended abstract] (VK, JS), pp. 401–410.

STOC-2013-MendesH #approximate #multi

Multidimensional approximate agreement in Byzantine asynchronous systems (HM, MH), pp. 391–400.

ESEC-FSE-2013-GooijerK #reuse

Agreements for software reuse in corporations (TdG, HK), pp. 679–682.

SOSP-2013-TerryPKBAA

Consistency-based service level agreements for cloud storage (DBT, VP, RK, MB, MKA, HAL), pp. 309–324.

ICALP-v2-2012-GroceKTZ

Byzantine Agreement with a Rational Adversary (AG, JK, AT, VZ), pp. 561–572.

SIGIR-2012-WebberTD

Effect of written instructions on assessor agreement (WW, BT, MD), pp. 1053–1054.

ICALP-v1-2011-HirtZ

Player-Centric Byzantine Agreement (MH, VZ), pp. 281–292.

EDOC-2011-PsaierSSD #resource management

Resource and Agreement Management in Dynamic Crowdcomputing Environments (HP, FS, DS, SD), pp. 193–202.

SAC-2011-TeixeiraLOM #modelling #probability

Planning service agreements in soa-based systems through stochastic models (MT, RMFL, CALO, PRMM), pp. 1576–1581.

ICALP-v2-2010-ChalopinD #mobile

Rendezvous of Mobile Agents without Agreement on Local Orientation (JC, SD), pp. 515–526.

LATA-2010-Casadio #analysis

Agreement and Cliticization in Italian: A Pregroup Analysis (CC), pp. 166–177.

IFM-2010-ArenasABW #approach

An Event-B Approach to Data Sharing Agreements (AEA, BA, JB, MDW), pp. 28–42.

SAC-2010-MatteucciPS #named #natural language

CNL4DSA: a controlled natural language for data sharing agreements (IM, MP, MLS), pp. 616–620.

VLDB-2009-CruzAS #named #ontology #performance #scalability

AgreementMaker: Efficient Matching for Large Real-World Schemas and Ontologies (IFC, FPA, CS), pp. 1586–1589.

CHI-2009-LawA #game studies #named #using

Input-agreement: a new mechanism for collecting data using human computation games (EL, LvA), pp. 1197–1206.

ICEIS-J-2009-LimaLO

Evaluating the Accessibility of Websites to Define Indicators in Service Level Agreements (STdL, FL, KMdO), pp. 858–869.

SIGIR-2009-BerminghamS #case study #retrieval

A study of inter-annotator agreement for opinion retrieval (AB, AFS), pp. 784–785.

SIGIR-2009-SmuckerAC #evaluation #information retrieval #statistics #testing

Agreement among statistical significance tests for information retrieval evaluation at varying sample sizes (MDS, JA, BC), pp. 630–631.

RE-2009-JuretaMF #analysis #multi #requirements #validation

Analysis of Multi-Party Agreement in Requirements Validation (IJ, JM, SF), pp. 57–66.

EDOC-2008-UngerLMS #process

Aggregation of Service Level Agreements in the Context of Business Processes (TU, FL, SM, TS), pp. 43–52.

SEKE-2008-HudertLW #framework

Negotiating Service Levels — A Generic Negotiation Framework for WS Agreement (SH, HL, GW), pp. 587–592.

ESOP-2007-BuscemiM #constraints #named #specification

CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements (MGB, UM), pp. 18–32.

CHI-2007-GoodGMK #empirical #scalability

Noticing notice: a large-scale experiment on the timing of software license agreements (NG, JG, DKM, JAK), pp. 607–616.

OCSC-2007-MaAL #authentication #protocol

Chameleon-Based Deniable Authenticated Key Agreement Protocol Secure Against Forgery (CM, JA, JL), pp. 124–133.

CAiSE-2007-CappielloCP #automation #generative #on the #web #web service

On Automated Generation of Web Service Level Agreements (CC, MC, PP), pp. 264–278.

MLDM-2007-FranceC #development #evaluation #metric #reduction

Development of an Agreement Metric Based Upon the RAND Index for the Evaluation of Dimensionality Reduction Techniques, with Applications to Mapping Customer Data (SLF, JDC), pp. 499–517.

SAC-2007-WaltersHC #algorithm #distributed

Selecting a distributed agreement algorithm (RJW, PH, SC), pp. 586–587.

SAC-2007-YanWZ #ad hoc #mobile #network #protocol

Dual agreement virtual subnet protocol for mobile ad-hoc networks (KQY, SCW, GYZ), pp. 953–954.

STOC-2006-Ben-OrPV

Byzantine agreement in the full-information model in O(log n) rounds (MBO, EP, VV), pp. 179–186.

STOC-2005-Aaronson #complexity

The complexity of agreement (SA), pp. 634–643.

STOC-2005-Ben-OrH #performance #quantum

Fast quantum byzantine agreement (MBO, AH), pp. 481–485.

STOC-2005-GafniGP #adaptation #bound #complexity #set

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.

STOC-2005-Holenstein

Key agreement from weak bit agreement (TH), pp. 664–673.

CIKM-2005-GrecoS #complexity #consistency #integration #on the #peer-to-peer #query

On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems (GG, FS), pp. 36–43.

SAC-2005-Strangio #performance #protocol

Efficient Diffie-Hellmann two-party key agreement protocols based on elliptic curves (MAS), pp. 324–331.

ICSM-2004-Kajko-MattssonAL #named

CM³: Service Level Agreement (MKM, CA, EL), pp. 432–436.

CAiSE-2004-ZdravkovicJ #process

Cooperation of Processes through Message Level Agreement (JZ, PJ), pp. 564–579.

KR-2004-AmgoudP #approach

Reaching Agreement Through Argumentation: A Possibilistic Approach (LA, HP), pp. 175–182.

ICSE-2004-SkeneLE #precise

Precise Service Level Agreements (JS, DDL, WE), pp. 179–188.

IJCAR-2004-SteelBM #induction #protocol

Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures (GS, AB, MM), pp. 137–151.

SOSP-2003-YinMVAD #execution #fault tolerance

Separating agreement from execution for byzantine fault tolerant services (JY, JPM, AV, LA, MD), pp. 253–267.

STOC-2002-LindellLR #authentication #composition #on the

On the composition of authenticated byzantine agreement (YL, AL, TR), pp. 514–523.

ICEIS-2002-NovaisBN #concept

The Concepts of Gratitude, Delegation and Agreement in Ecenvironments (PN, LB, JN), pp. 1103–1106.

SAC-2002-Ungureanu #data access #e-commerce

An agreement centric access control mechanism for business to business e-commerce (VU), pp. 1160–1164.

WLC-2000-YamamuraK #protocol

Key Agreement Protocol Securer than DLOG (AY, KK), pp. 450–465.

ICEIS-2000-BritoNN

Mediation, Agreement and Gratitude in Strategic Planning for Virtual Organisations (LB, PN, JN), pp. 395–401.

ICALP-1999-HassinP #distributed #probability

Distributed Probabilistic Polling and Applications to Proportionate Agreement (YH, DP), pp. 402–411.

HCI-CC-1997-TakadaTS

Post Agreement Utterance: Communications Specific to Media Conferences (KT, HT, YS), pp. 41–44.

STOC-1993-CanettiR #performance

Fast asynchronous Byzantine agreement with optimal resilience (RC, TR), pp. 42–51.

STOC-1993-GarayM #polynomial

Fully polynomial Byzantine agreement in t+1 rounds (JAG, YM), pp. 31–41.

STOC-1993-SaksZ

Wait-free k-set agreement is impossible: the topology of public knowledge (MES, FZ), pp. 101–110.

STOC-1991-AttiyaDLS #bound #nondeterminism

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty (HA, CD, NAL, LJS), pp. 359–369.

PODS-1989-Tay

Attribute Agreement (YCT), pp. 110–119.

STOC-1989-GrahamY #on the

On the Improbability of Reaching Byzantine Agreements (Preliminary Version) (RLG, ACCY), pp. 467–478.

ICALP-1989-FeldmanM #algorithm #probability

An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (PF, SM), pp. 341–378.

STOC-1988-FeldmanM #algorithm

Optimal Algorithms for Byzantine Agreement (PF, SM), pp. 148–161.

PODS-1984-Garcia-MolinaPD #database #distributed #question

Is Byzantine Agreement Useful in a Distributed Database? (HGM, FMP, SBD), pp. 61–69.

STOC-1982-DolevS #algorithm #multi #polynomial

Polynomial Algorithms for Multiple Processor Agreement (DD, HRS), pp. 401–407.