Sciweavers

17770 search results - page 164 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 2 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
138
Voted
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 2 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
124
Voted
HRI
2006
ACM
15 years 8 months ago
FOCUS: a generalized method for object discovery for robots that observe and interact with humans
The essence of the signal-to-symbol problem consists of associating a symbolic description of an object (e.g., a chair) to a signal (e.g., an image) that captures the real object....
Manuela M. Veloso, Paul E. Rybski, Felix von Hunde...
121
Voted
SI3D
1999
ACM
15 years 7 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
160
Voted
DCG
2008
118views more  DCG 2008»
15 years 2 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk