Author image not provided
 Robert A Van Engelen

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.00
Citation Count84
Publication count14
Publication years2000-2011
Available for download4
Average downloads per article472.50
Downloads (cumulative)1,890
Downloads (12 Months)34
Downloads (6 Weeks)3
Arrow RightAuthor only
· Advisor only
· All roles

See all colleagues of this author

See all subject areas


14 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 14 of 14
Sort by:

September 2011 HPCC '11: Proceedings of the 2011 IEEE International Conference on High Performance Computing and Communications
Publisher: IEEE Computer Society
Citation Count: 0

Importance sampling is a widely-used method for probabilistic inference with Bayesian probabilistic networks. Importance sampling is relatively easy to parallelize and parallel GPU implementations yield significant speedups over single-CPU implementations. However, because of physical limitations of GPU memory size and bandwidth, the maximum speedups that can be achieved are bounded ...
Keywords: Probabilistic graph models, Bayesian inference, Importance sampling, GPGPU parallelization

July 2011 UAI'11: Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence
Publisher: AUAI Press
Citation Count: 0

Approximate Bayesian inference is NP-hard. Dagum and Luby defined the Local Variance Bound (LVB) to measure the approximation hardness of Bayesian inference on Bayesian networks, assuming the networks model strictly positive joint probability distributions, i.e. zero probabilities are not permitted. This paper introduces the k -test to measure the approximation ...

December 2008 ESCIENCE '08: Proceedings of the 2008 Fourth IEEE International Conference on eScience
Publisher: IEEE Computer Society
Citation Count: 0

This paper presents an adaptive XML parser that is based on table-driven XML (TDX) parsing technology. This technique can be used for developing extensible high-performance Web services for large complex systems that typically require extensible schemas. The parser integrates scanning, parsing, and validation into a single-pass without backtracking by utilizing ...
Keywords: XML, Parsing, Validating, Web Services, Extensible, Schema Updates, TDX, pTDX, Table-driven XML parsing, permutation phrase

July 2008 SERVICES '08: Proceedings of the 2008 IEEE Congress on Services - Part I
Publisher: IEEE Computer Society
Citation Count: 0

WS-Security is an essential component of the Web services protocol stack. WS-Security provides end-to-end security properties, thereby assuring the participation of non-secure transport intermediaries in message exchanges, a key advantage in Web-based systems. However, compared to point-to-point secure messaging with TLS, WS-Security has a significant performance penalty. In this paper, ...

5 published by ACM
May 2008 ACM Transactions on Internet Technology (TOIT): Volume 8 Issue 3, May 2008
Publisher: ACM
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Downloads (Overall): 994

Full text available: PDFPDF
Service-oriented architectures use loosely coupled software services to support the requirements of business processes and software users. Several software engineering challenges have to be overcome to expose legacy C and C++ applications and specialized system resources as XML-based software services. It is critical to devise effective bindings between XML and ...
Keywords: Service-oriented computing, Web services standards

6 published by ACM
November 2006 ACM Transactions on Embedded Computing Systems (TECS): Volume 5 Issue 4, November 2006
Publisher: ACM
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 493

Full text available: PDFPDF
Software designers face many challenges when developing applications for embedded systems. One major challenge is meeting the conflicting constraints of speed, code size, and power consumption. Embedded application developers often resort to hand-coded assembly language to meet these constraints since traditional optimizing compiler technology is usually of little help in ...
Keywords: phase ordering, interactive compilation, User-directed code improvement, genetic algorithms

7 published by ACM
September 2006 PACT '06: Proceedings of the 15th international conference on Parallel architectures and compilation techniques
Publisher: ACM
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 232

Full text available: PDFPDF
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instances in the iteration space of a loop nest impose ordering constraints that must be preserved in order to produce valid optimized, vectorized, and parallelized loop nests. This paper evaluates ...
Keywords: loop optimization, dependence testing, chains of recurrences

April 2005 ITCC '05: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Publisher: IEEE Computer Society
Citation Count: 6

In this paper we report on the current status of the GSI plug-in for gSOAP, an open source solution to the problem of securing web services in grid environments.

November 2004 GRID '04: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Publisher: IEEE Computer Society
Citation Count: 13
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 171

Full text available: PDFPDF
The SOAP protocol underpins Web services as the standard mechanism for exchanging information in a distributed environment. The XML-based protocol offers advantages including extensibility, interoperability, and robustness. The merger of Web services and grid computing promotes SOAP into a standard protocol for the large-scale scientific applications that computational grids promise ...
Keywords: Grid Computing, Web Services, SOAP, Scientific Computing, Communication Performance

April 2002 ICCS '02: Proceedings of the International Conference on Computational Science-Part I
Publisher: Springer-Verlag
Citation Count: 1

Traditional design and implementation of large atmospheric models is a difficult, tedious and erroneous task. With the Ctadel project we propose a new method of code generation, where the designer describes the model in an abstract high-level specification language which is translated into highly optimized Fortran code. In this paper ...

August 2001 Euro-Par '01: Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Publisher: Springer-Verlag
Citation Count: 1

A swap instruction, which exchanges a value in memory with a value of a register, is available on many architectures. The primary application of a swap instruction has been for process synchronization. As an experiment we wished to see how often a swap instruction can be used to coalesce loads ...

April 2001 CC '01: Proceedings of the 10th International Conference on Compiler Construction
Publisher: Springer-Verlag
Citation Count: 12

Because most of the execution time of a program is typically spend in loops, loop optimization is the main target of optimizing and restructuring compilers. An accurate determination of induction variables and dependencies in loops is of paramount importance to many loop optimization and parallelization techniques, such as generalized loop ...

June 2000 LCTES '00: Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems
Publisher: Springer-Verlag
Citation Count: 5

Programmers of embedded systems often develop software in assembly code due to critical speed and/or space constraints and inadequate support from compilers. Many embedded applications are being used as a component of an increasing number of critical systems. While achieving high performance for these systems is important, ensuring that these ...

May 2000 Real-Time Systems - Special issue on worst-case execution-time analysis: Volume 18 Issue 2/3, May 2000
Publisher: Kluwer Academic Publishers
Citation Count: 36

Static timing analyzers, which are used to analyze real-time systems, need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. This paper describes three complementary methods to support timing analysis by bounding the number of ...
Keywords: static analysis, hard real-time systems, worst-case execution time

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us