Sciweavers

2034 search results - page 157 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
CLUSTER
2004
IEEE
13 years 12 months ago
Towards informatic analysis of Syslogs
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
John Stearley
LREC
2008
102views Education» more  LREC 2008»
13 years 9 months ago
Unsupervised Parts-of-Speech Induction for Bengali
We present a study of the word interaction networks of Bengali in the framework of complex networks. The topological properties of these networks reveal interesting insights into ...
Joy Deep Nath, Monojit Choudhury, Animesh Mukherje...
SIGSOFT
2004
ACM
14 years 9 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
PAMI
2012
11 years 10 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
NOSSDAV
2009
Springer
14 years 2 months ago
SLIPstream: scalable low-latency interactive perception on streaming data
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
Padmanabhan Pillai, Lily B. Mummert, Steven W. Sch...