Sciweavers

2084 search results - page 286 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
MMDB
2004
ACM
153views Multimedia» more  MMDB 2004»
15 years 3 months ago
A PCA-based similarity measure for multivariate time series
Multivariate time series (MTS) datasets are common in various multimedia, medical and financial applications. We propose a similarity measure for MTS datasets, Eros (Extended Fro...
Kiyoung Yang, Cyrus Shahabi
COMSWARE
2007
IEEE
15 years 4 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
STACS
2005
Springer
15 years 3 months ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer
CISC
2007
Springer
155views Cryptology» more  CISC 2007»
15 years 1 months ago
ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message
Abstract. In this paper, we propose a signcryption scheme which provides all the following properties at the same time. (1) forward security: the private key of a sender does not h...
Raylin Tso, Takeshi Okamoto, Eiji Okamoto
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
15 years 10 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala