Sciweavers

1542 search results - page 298 / 309
» Kernelization of packing problems
Sort
View
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
OSDI
2006
ACM
14 years 7 months ago
Operating System Profiling via Latency Analysis
Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavi...
Nikolai Joukov, Avishay Traeger, Rakesh Iyer, Char...
OSDI
2006
ACM
14 years 7 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...
PPOPP
2010
ACM
14 years 4 months ago
Scaling LAPACK panel operations using parallel cache assignment
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
Anthony M. Castaldo, R. Clint Whaley
EUROSYS
2008
ACM
14 years 4 months ago
Manageable fine-grained information flow
The continuing frequency and seriousness of security incidents underlines the importance of application security. Decentralized information flow control (DIFC), a promising tool ...
Petros Efstathopoulos, Eddie Kohler