Sciweavers

2239 search results - page 187 / 448
» Computing with abstract matrix structures
Sort
View
143
Voted
TSP
2010
14 years 10 months ago
Covariance estimation in decomposable Gaussian graphical models
Graphical models are a framework for representing and exploiting prior conditional independence structures within distributions using graphs. In the Gaussian case, these models are...
Ami Wiesel, Yonina C. Eldar, Alfred O. Hero
SIGCSE
2009
ACM
137views Education» more  SIGCSE 2009»
16 years 4 months ago
The hidden injuries of overloading 'ADT'
commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, lik...
Duane Buck, David J. Stucki
107
Voted
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
15 years 9 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
133
Voted
ITP
2010
172views Mathematics» more  ITP 2010»
15 years 2 months ago
Automated Machine-Checked Hybrid System Safety Proofs
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
Herman Geuvers, Adam Koprowski, Dan Synek, Eelis v...
144
Voted
AAAI
2008
15 years 6 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang