✦ LIBER ✦

Simple and parallel proximity algorithms for general polygonal models

✍ Scribed by Youngeun Lee; Young J. Kim

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 569 KB
Volume: 21
Category: Article
ISSN: 1546-4261
DOI: 10.1002/cav.359

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cluster Identification Algorithms for Sp

Cluster Identification Algorithms for Spin Models — Sequential and Parallel

✍ Baillie, Clive F. ;Coddington, Paul D. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 963 KB

Parallel proximal-point algorithms for m

Parallel proximal-point algorithms for mixed finite element models of flow in the subsurface

✍ Alduncin, Gonzalo ;Vera-Guzmán, Norberto 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB 👁 1 views

## Abstract Parallel proximal‐point algorithms for mixed finite element models of flow in the subsurface are presented. The applied methodology corresponds to operator splitting and non‐overlapping domain decomposition methods, combined with resolvent or proximation characterizations and proximal‐p

Models and Scheduling Algorithms for Mix

Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs

✍ Soumen Chakrabarti; James Demmel; Katherine Yelick 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

An increasing number of scientific programs exhibit two forms of parallelism, often in a nested fashion. At the outer level, the application comprises coarse-grained task parallelism, with dependencies between tasks reflected by an acyclic graph. At the inner level, each node of the graph is a data-

Parallel Algorithms for Counting and Ran

Parallel Algorithms for Counting and Randomly Generating Integer Partitions

✍ Laura A. Sanchis; Matthew B. Squire 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 228 KB

This paper presents parallel algorithms for determining the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being composed of distinct parts, of a given number of parts, and/or of parts belonging to a specified set. We present a series of adapt

A simple algorithm for generating stream

A simple algorithm for generating streamflow networks for grid-based, macroscale hydrological models

✍ Greg O'Donnell; Bart Nijssen; Dennis P. Lettenmaier 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 602 KB

A simple algorithm for generating stream¯ow networks for macroscale hydrological models (MHMs) from digital elevation models (DEMs) is presented. Typically these hydrological models are grid based, with the simulated runo produced within each cell routed through a stream network which connects the c

Simple Markov-chain algorithms for gener

Simple Markov-chain algorithms for generating bipartite graphs and tournaments

✍ Ravi Kannan; Prasad Tetali; Santosh Vempala 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We consider two problems: randomly generating labeled bipartite graphs with a given degree sequence and randomly generating labeled tournaments with a given score sequence. We analyze simple Markov chains for both problems. For the first problem, we cannot prove that our chain is rapidly mixing in g