Sciweavers

4541 search results - page 553 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
PST
2008
15 years 8 months ago
LogView: Visualizing Event Log Clusters
Event logs or log files form an essential part of any network management and administration setup. While log files are invaluable to a network administrator, the vast amount of dat...
Adetokunbo Makanju, Stephen Brooks, A. Nur Zincir-...
ISCI
2008
116views more  ISCI 2008»
15 years 7 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 5 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
EJC
2009
15 years 4 months ago
From Word Form Surfaces to Communication
The starting point of this paper is the external surface of a word form, for example the agent-external acoustic perturbations constituting a language sign in speech or the dots o...
Roland Hausser
IJON
2010
121views more  IJON 2010»
15 years 4 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen