Sciweavers

4744 search results - page 518 / 949
» Connected Computing
Sort
View
SIGGRAPH
1992
ACM
15 years 11 months ago
Re-tiling polygonal surfaces
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
Greg Turk
CCS
2006
ACM
15 years 10 months ago
Hot or not: revealing hidden services by their clock skew
Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden service...
Steven J. Murdoch
FOCS
2004
IEEE
15 years 10 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
VISUALIZATION
1991
IEEE
15 years 10 months ago
A Tool for Visualizing the Topology of Three-Dimensional Vector Fields
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
Al Globus, C. Levit, T. Lasinski