Sciweavers

950 search results - page 50 / 190
» Modified global k
Sort
View
DM
2008
68views more  DM 2008»
13 years 10 months ago
Heavy cycles in k-connected weighted graphs with large weighted degree sums
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
ICASSP
2010
IEEE
13 years 8 months ago
Sectored Random Projections for Cancelable Iris Biometrics
Privacy and security are essential requirements in practical biometric systems. In order to prevent the theft of biometric patterns, it is desired to modify them through revocable...
Jaishanker K. Pillai, Vishal M. Patel, Rama Chella...
IJON
2007
102views more  IJON 2007»
13 years 10 months ago
Methodology for long-term prediction of time series
In this paper, a global methodology for the long-term prediction of time series is proposed. This methodology combines direct prediction strategy and sophisticated input selection...
Antti Sorjamaa, Jin Hao, Nima Reyhani, Yongnan Ji,...
COMAD
2009
13 years 11 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
FSE
2004
Springer
167views Cryptology» more  FSE 2004»
14 years 3 months ago
Nonce-Based Symmetric Encryption
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function E of the message M and the key K: the user su...
Phillip Rogaway