Sciweavers

139 search results - page 11 / 28
» Sparse Projections over Graph
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 1 months ago
Temporal Analysis of Semantic Graphs Using ASALSAN
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or th...
Brett W. Bader, Richard A. Harshman, Tamara G. Kol...
SIGPLAN
1998
13 years 7 months ago
The DrScheme Project: An Overview
DrScheme provides a graphical user interface for editing and interactively evaluating Scheme programs on all major graphical platforms (Windows 95/nt, MacOs, Unix/X). The environm...
Matthias Felleisen, Robert Bruce Findler, Matthew ...
CVPR
2007
IEEE
14 years 9 months ago
Learning GMRF Structures for Spatial Priors
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
Lie Gu, Eric P. Xing, Takeo Kanade
SIROCCO
2010
13 years 9 months ago
Average Long-Lived Memoryless Consensus: The Three-Value Case
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
Ivan Rapaport, Eric Rémila