Sciweavers

126 search results - page 17 / 26
» Lossless Representation of Graphs using Distributions
Sort
View
NIPS
2004
14 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
VLDB
1998
ACM
117views Database» more  VLDB 1998»
15 years 1 months ago
DTL's DataSpot: Database Exploration Using Plain Language
DTL's DataSpot is a database publishing tool that enables non-technical end users to explore a database using free-form plain language queries combined with hypertext navigat...
Shaul Dar, Gadi Entin, Shai Geva, Eran Palmon
ICML
2009
IEEE
15 years 10 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
INFOVIS
2005
IEEE
15 years 3 months ago
Interactive Sankey Diagrams
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
Patrick Riehmann, Manfred Hanfler, Bernd Froehlich
90
Voted
CIKM
2010
Springer
14 years 7 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu