Sciweavers

7758 search results - page 18 / 1552
» On the Number of Distributive Lattices
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 9 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
CVPR
2010
IEEE
1639views Computer Vision» more  CVPR 2010»
14 years 4 months ago
Multi-Target Tracking of Time-varying Spatial Patterns
Time-varying spatial patterns are common, but few computational tools exist for discovering and tracking multiple, sometimes overlapping, spatial structures of targets. We propose...
Jingchen Liu, Yanxi Liu
FFA
2006
79views more  FFA 2006»
13 years 8 months ago
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the deal...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
VIS
2007
IEEE
183views Visualization» more  VIS 2007»
14 years 10 months ago
Lattice Based Volumetric Global Illumination
We describe a novel volumetric global illumination framework based on the Face-Centered Cubic (FCC) lattice. An FCC lattice has important advantages over a Cartesian lattice. It ha...
Feng Qiu, Fang Xu, Zhe Fan, Neophytos Neophytou...
SIAMADS
2011
12 years 11 months ago
Breathers in a Pinned Mechanical Lattice
Discrete breathers are found in a nonlinear one dimensional axially loaded mechanical lattice consisting of rigid links supported laterally by linear springs. We find link centere...
S. C. Green, C. J. Budd, G. W. Hunt