Sciweavers

1019 search results - page 32 / 204
» Uniform Functors on Sets
Sort
View
IANDC
2006
113views more  IANDC 2006»
13 years 7 months ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
JDA
2008
100views more  JDA 2008»
13 years 7 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
WSC
2008
13 years 10 months ago
Designing simulation experiments with controllable and uncontrollable factors
In this study we propose a new method for designing computer experiments inspired by the split plot designs used in physical experimentation. The basic layout is that each set of ...
Christian Dehlendorff, Murat Kulahci, Klaus K. And...
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 9 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
COMPGEOM
2006
ACM
14 years 1 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl