Sciweavers

1871 search results - page 355 / 375
» The Ephemeral Pairing Problem
Sort
View
ICALP
2010
Springer
15 years 3 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
EUROPAR
2001
Springer
15 years 3 months ago
Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
Paul D. Ezhilchelvan, Jean-Michel Hélary, M...
78
Voted
IWANN
2001
Springer
15 years 3 months ago
Is Neural Network a Reliable Forecaster on Earth? A MARS Query!
: Long-term rainfall prediction is a challenging task especially in the modern world where we are facing the major environmental problem of global warming. In general, climate and ...
Ajith Abraham, Dan Steinberg
ACSAC
2000
IEEE
15 years 3 months ago
Introducing Decryption Authority into PKI
It is well-known that CA plays the central role in PKI. In this paper we introduce a new component into PKI, DA (decryption authority), which decrypts important and sensitive mess...
Feng Bao
SIGGRAPH
1999
ACM
15 years 3 months ago
Multiresolution Mesh Morphing
We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a corresponde...
Aaron W. F. Lee, David P. Dobkin, Wim Sweldens, Pe...