208 search results - page 4 / 42 » Computing Anonymously with Arbitrary Knowledge |
99
Voted
SIBGRAPI
2007
IEEE
15 years 9 months ago
2007
IEEE
Most direct manipulation tasks rely on precise placements of the cursor on the object of interest. Commonly, this requires the knowledge of distinct application-dependent geometry...
104
Voted
WDAG
2007
Springer
15 years 8 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
124
Voted
CCS
2005
ACM
15 years 8 months ago
2005
ACM
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
129
Voted
SIGCOMM
2003
ACM
15 years 8 months ago
2003
ACM
Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive...
148
Voted
VDA
2010
15 years 18 days ago
2010
The exploration of multidimensional scalar fields is commonly based on the knowledge of the topology of their isosurfaces. The latter is established through the analysis of critic...