Sciweavers

1068 search results - page 211 / 214
» Factorization as a Rank 1 Problem
Sort
View
88
Voted
IPL
2006
141views more  IPL 2006»
14 years 9 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
84
Voted
DAM
2007
107views more  DAM 2007»
14 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
SIGIR
2008
ACM
14 years 9 months ago
Enhancing text clustering by leveraging Wikipedia semantics
Most traditional text clustering methods are based on "bag of words" (BOW) representation based on frequency statistics in a set of documents. BOW, however, ignores the ...
Jian Hu, Lujun Fang, Yang Cao, Hua-Jun Zeng, Hua L...
JOC
2007
133views more  JOC 2007»
14 years 9 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
TSP
2008
117views more  TSP 2008»
14 years 9 months ago
Sample Eigenvalue Based Detection of High-Dimensional Signals in White Noise Using Relatively Few Samples
The detection and estimation of signals in noisy, limited data is a problem of interest to many scientific and engineering communities. We present a mathematically justifiable, com...
R. R. Nadakuditi, A. Edelman