Sciweavers

603 search results - page 120 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
14 years 9 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
13 years 11 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor
SOSP
2003
ACM
15 years 8 months ago
User-level internet path diagnosis
Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consid...
Ratul Mahajan, Neil T. Spring, David Wetherall, Th...
CIKM
2004
Springer
15 years 5 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
SACMAT
2010
ACM
15 years 4 months ago
Mining roles with noisy data
There has been increasing interest in automatic techniques for generating roles for role based access control, a process known as role mining. Most role mining approaches assume t...
Ian Molloy, Ninghui Li, Yuan (Alan) Qi, Jorge Lobo...