1399 search results - page 98 / 280 » Multi-party Finite Computations |
126
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
155
Voted
CG
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents an approach to performing time-critical collision detection for deformable objects. The deformable objects are represented by dense meshes and their deformatio...
122
Voted
SAC
2008
ACM
15 years 3 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
122
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
130
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...