Sciweavers

2079 search results - page 117 / 416
» Universality of random graphs
Sort
View
WWW
2008
ACM
16 years 5 months ago
Behavioral classification on the click graph
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
Martin Szummer, Nick Craswell
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
15 years 11 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
15 years 10 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
DSD
2005
IEEE
96views Hardware» more  DSD 2005»
15 years 6 months ago
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
Peter Filter, Hana Kubatova
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 1 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat