Sciweavers

1066 search results - page 78 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ICRA
2005
IEEE
145views Robotics» more  ICRA 2005»
15 years 3 months ago
Computation and Graphical Characterization of Robust Multiple-Contact Postures in 2D Gravitational Environments
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
Yizhar Or, Elon Rimon
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 3 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
SAC
2005
ACM
15 years 3 months ago
Privacy preserving learning in negotiation
Machine learning techniques are widely used in negotiation systems. To get more accurate and satisfactory learning results, negotiation parties have the desire to employ learning ...
Sheng Zhang, Fillia Makedon
TCC
2010
Springer
208views Cryptology» more  TCC 2010»
15 years 6 months ago
Rationality in the Full-Information Model
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
Ronen Gradwohl
PODC
2010
ACM
15 years 1 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...