Sciweavers

7827 search results - page 1565 / 1566
» time 2007
Sort
View
IACR
2011
104views more  IACR 2011»
12 years 5 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
WWW
2007
ACM
14 years 6 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
MOBIHOC
2007
ACM
14 years 5 months ago
A random perturbation-based scheme for pairwise key establishment in sensor networks
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
Wensheng Zhang, Minh Tran, Sencun Zhu, Guohong Cao
BMCBI
2008
129views more  BMCBI 2008»
13 years 5 months ago
Motif-directed network component analysis for regulatory network inference
Background: Network Component Analysis (NCA) has shown its effectiveness in discovering regulators and inferring transcription factor activities (TFAs) when both microarray data a...
Chen Wang, Jianhua Xuan, Li Chen, Po Zhao, Yue Wan...
« Prev « First page 1565 / 1566 Last » Next »