Sciweavers

15485 search results - page 200 / 3097
» Computing Optimal Subsets
Sort
View
ICSE
2004
IEEE-ACM
16 years 6 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
EDBT
2010
ACM
246views Database» more  EDBT 2010»
16 years 1 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
SAC
2006
ACM
15 years 6 months ago
Combining supervised and unsupervised monitoring for fault detection in distributed computing systems
Fast and accurate fault detection is becoming an essential component of management software for mission critical systems. A good fault detector makes possible to initiate repair a...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
LISA
1994
15 years 7 months ago
The Group Administration Shell and the GASH Network Computing Environment
Managing large scale UNIX networks so that users can use resources on multiple systems is traditionally performed using NIS, NFS, and DNS. Proper use of these tools requires exact...
Jonathan Abbey
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 6 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen