Sciweavers

526 search results - page 2 / 106
» Increments of Random Partitions
Sort
View
EMNLP
2007
13 years 6 months ago
Incremental Generation of Plural Descriptions: Similarity and Partitioning
Approaches to plural reference generation emphasise descriptive brevity, but often lack empirical backing. This paper describes a corpus-based study of plural descriptions, and pr...
Albert Gatt, Kees van Deemter
COMPGEOM
2003
ACM
13 years 10 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
COMBINATORICS
2000
61views more  COMBINATORICS 2000»
13 years 5 months ago
Where the Typical Set Partitions Meet and Join
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...
Boris Pittel
AIIA
2009
Springer
13 years 12 months ago
Partitioning Search Spaces of a Randomized Search
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...