17082 search results - page 3184 / 3417 » Abstractions for Mobile Computation |
164
click to vote
PKC
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
172
click to vote
TAMC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
185
click to vote
WAPCV
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Most cognitive studies of language acquisition in both natural systems and artificial systems have focused on the role of purely linguistic information as the central co...
173
click to vote
ACIVS
2006
Springer
16 years 20 days ago
2006
Springer
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...
193
click to vote
INFOCOM
2005
IEEE
16 years 8 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...