Filters








90,109 Hits in 3.8 sec

How to withstand mobile virus attacks (extended abstract)

Rafail Ostrovsky, Moti Yung
1991 Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91  
We show how local computations (at each processor) and global computations can be polynomial factor-redundancy in the  ...  We initiate a study of distributed adversarial model of computation in which faults are non-stationary and can move through the net work, analogous to a spread of a virus or a worm.  ...  Thus, by extending results developed in [BGW, CCD, BB, RB] to be resilient against a more pow- erful adversary, we provide a computation technique robust against mobile viruses, using  ... 
doi:10.1145/112600.112605 dblp:conf/podc/OstrovskyY91 fatcat:dp4ujza57rev7dghzgjj2uthzu

Inversion of Large-scale ZTEM Data

Elliot Holtham, Douglas W. Oldenburg
2012 ASEG Extended Abstracts  
Here it is up to the user to choose a reasonable number of tiles such that each tile runs efficiently on their available computer hardware.  ...  Although computer technology continues to improve, clock speed and instruction level parallelism has started to flatten since 2003 (Shalf, 2007) .  ... 
doi:10.1071/aseg2012ab171 fatcat:bfwx5v2sgzfnfimj7edjyej4m4

Variational Bayes in Private Settings (VIPS) (Extended Abstract)

James R. Foulds, Mijung Park, Kamalika Chaudhuri, Max Welling
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
In the full paper we extend our method to a broad class of models, including Bayesian logistic regression and sigmoid belief networks.  ...  Then it can be accelerated by parallel computations in GPU.  ...  In contrast, traditional solvers, which are mostly performed on CPU, often require iterative computation and more logic operation, being less parallel-friendly, more time-consuming and power intensive.  ... 
doi:10.24963/ijcai.2020/694 dblp:conf/ijcai/YanYH20 fatcat:pc4nelo7gzfmvmsiym3ohwspxa

The performance of work stealing in multiprogrammed environments (extended abstract)

Robert D. Blumofe, Dionisios Papadopoulos
1998 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems - SIGMETRICS '98/PERFORMANCE '98  
With this implementation, the execution time of a computation running with arbitrarily many processes on arbitrarily many processors can be modeled as a simple function of work and critical-path length  ...  Such a scheduler could be employed by a parallelizing compiler, or the runtime system for a multithreaded language such as Cilk [14] or Java [8] .  ...  Thus, our model is extraordinarily robust.  ... 
doi:10.1145/277851.277939 dblp:conf/sigmetrics/BlumofeP98 fatcat:nhxrsndun5ehtpdaa4bscdr3p4

The performance of work stealing in multiprogrammed environments (extended abstract)

Robert D. Blumofe, Dionisios Papadopoulos
1998 Performance Evaluation Review  
With this implementation, the execution time of a computation running with arbitrarily many processes on arbitrarily many processors can be modeled as a simple function of work and critical-path length  ...  Such a scheduler could be employed by a parallelizing compiler, or the runtime system for a multithreaded language such as Cilk [14] or Java [8] .  ...  Thus, our model is extraordinarily robust.  ... 
doi:10.1145/277858.277939 fatcat:hoe4swj2ubdj7hcw7ljhfiaqdi

Proofs of Work and Bread Pudding Protocols(Extended Abstract) [chapter]

Markus Jakobsson, Ari Juels
1999 Secure Information Networks  
computation.  ...  By contrast, in a POW, a prover demonstrates to a verifier that she has performed a certain amount of computational work in a specified interval of time.  ...  We consider the number of steps of computation performed by the verifier on a correct transcript, as the verifier can always terminate its computation after this many steps.  ... 
doi:10.1007/978-0-387-35568-9_18 fatcat:7h24a7dje5dszl57xxjjzhzhue

Slate: extending Firedrake's domain-specific abstraction to hybridized solvers for geoscience and beyond [article]

Thomas H. Gibson, Lawrence Mitchell, David A. Ham, Colin J. Cotter
2019 arXiv   pre-print
However, robust and efficient solvers for the resulting saddle-point and elliptic systems arising from these discretizations continue to be an on-going challenge.  ...  However, it is challenging to implement hybridization as performant parallel code within complex models, whilst maintaining separation of concerns between applications scientists and software experts.  ...  All results were computed in parallel, utilizing a single compute node (described previously).  ... 
arXiv:1802.00303v4 fatcat:jpeqzk2ztjh2nor62oqwgy7p2u

Adapting to change in complex work environments

John R. Hajdukiewicz
2000 CHI '00 extended abstracts on Human factors in computer systems - CHI '00  
The purpose of this research is to look at the problem of how to design human-computer interfaces that help people adapt to novelty and change in complex work environments.  ...  In the manipulation phase, specific changes to the work domain or human-computer interface will be randomly introduced. This phase will last for 20 trials.  ...  These results provide evidence that TL controlled the work domain by adopting a rote set of procedures that allowed for efficient control under normal conditions.  ... 
doi:10.1145/633332.633345 fatcat:xcotxoiqqzdhjdc5xcqvhohagq

Human-computer interaction

Keith A. Butler, Robert J. K. Jacob, Bonnie E. John
1999 CHI '99 extended abstracts on Human factors in computer systems - CHI '99  
It uses tree-based filtering to efficiently propagate a probability distribution over poses of a 3D body model.  ...  We present two applications of our method that work in real-time on a Cell Broadband Engine TM : a computer game and a virtual clothing application. key words: video motion capture, tree-based filtering  ...  , computed in parallel on all seven SPEs, respectively.  ... 
doi:10.1145/632780.632781 fatcat:twoo3zooljenfndsds2323flb4

An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) [chapter]

Ran Canetti, Shafi Goldwasser
1999 Lecture Notes in Computer Science  
General completeness results for multi-party computations [6,13] enable in principle converting any single server PKC secure against CCA (e.g., [19, 17] ) into a threshold one, but the conversions are  ...  For lack of space we only sketch the definition in this extended abstract. See [12] for full details on the definition and the relations with that of [25] . Outline of our definition.  ...  This can be done using general multi-party computation techniques [26, 6, 13] or more efficiently using techniques from [35] .  ... 
doi:10.1007/3-540-48910-x_7 fatcat:psosdgik2ffchjhkq2b4opp7ai

BreachFlows: Simulation-Based Design with Formal Requirements for Industrial CPS (Extended Abstract)

Alexandre Donzé, Jyotirmoy V. Deshmukh, Sebastian Steinhorst
2020 Design, Automation, and Test in Europe  
in a corresponding configuration; Various features helping with high cost of simulation and heterogeneity: Use of parallel computation when possible; System of efficient disk caching mechanism to reload  ...  Breach implements the efficient quantitative monitoring algorithm of [4] , so that computing the quantitative satisfaction of a requirement is generally a negligible overhead compared to computing a simulation  ... 
doi:10.4230/oasics.asd.2020.5 dblp:conf/date/Donze20 fatcat:5m65e3zikvd4lji2tekbhe5ys4

Interactive proofs for BQP via self-tested graph states (extended abstract) [article]

Matthew McKague
2013 arXiv   pre-print
In this extended abstract we give an overview of the construction and proofs.  ...  Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier.  ...  In this extended abstract we give an overview of the constructions and proofs. For additional details and a full error analysis we refer the reader to [McK13] .  ... 
arXiv:1311.1534v1 fatcat:p26svrv7hfd5zpu5luuxn5z57a

Curvature-constrained shortest paths in a convex polygon (extended abstract)

Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
1998 Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98  
Jacobs and Canny [13] , Wang and Agarwal [30] , and Sellen [27, 28] gave approximation algorithms for computing an "-robust path.  ...  In this paper we propose an efficient algorithm for computing a curvature-constrained shortest path inside a convex polygon.  ... 
doi:10.1145/276884.276928 dblp:conf/compgeom/AgarwalBLRSW98 fatcat:wa6cqwbz6zfavjhqxtvzxxpr7u

Defining a deep fault network for Australia, using 3D 'worming'

Desmond FitzGerald, Peter Milligan
2013 ASEG Extended Abstracts  
Depth Estimation There have been several attempts at defining an efficient and sufficiently robust method of estimating a "true" depth of the edge points.  ...  Computational efficiency has also dominated thinking on this subject, and it remains very important when attempting continental scale studies.  ... 
doi:10.1071/aseg2013ab135 fatcat:drjgr3gf4bck5fedttor5svzdi

Stochastic methods for model assessment of airborne frequency-domain electromagnetic data

Burke J. Minsley, James Irving, Jared D. Abraham, Bruce D. Smith
2012 ASEG Extended Abstracts  
In either case, this step is easily parallelized, with each forward calculation assigned to a different processor.  ...  This parameterization naturally incorporates lateral constraints in the proposed models, which is important for efficiently sampling the model space.  ...  Calculating the forward response to a proposed model, which is the most computationally expensive part of the algorithm, is readily parallelized because of the limited footprint of the airborne system.  ... 
doi:10.1071/aseg2012ab245 fatcat:62aoepujwneptm7i4ohspa3nai
« Previous Showing results 1 — 15 out of 90,109 results