Sciweavers

4843 search results - page 834 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
PG
2000
IEEE
15 years 7 months ago
Morphing Using Curves and Shape Interpolation Techniques
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
Henry Johan, Yuichi Koiso, Tomoyuki Nishita
CONCUR
2000
Springer
15 years 7 months ago
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
SIGMOD
1999
ACM
125views Database» more  SIGMOD 1999»
15 years 7 months ago
Selectivity Estimation in Spatial Databases
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
Swarup Acharya, Viswanath Poosala, Sridhar Ramaswa...
INFOCOM
1999
IEEE
15 years 7 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
EUROCRYPT
1999
Springer
15 years 7 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold