Sciweavers

3008 search results - page 244 / 602
» Independence in connected graphs
Sort
View
ACL
2009
15 years 4 months ago
Markov Random Topic Fields
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
Hal Daume III
JMLR
2010
143views more  JMLR 2010»
15 years 1 months ago
Beware of the DAG!
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
A. Philip Dawid
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
14 years 6 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CHI
2006
ACM
16 years 7 months ago
GUESS: a language and interface for graph exploration
As graph models are applied to more widely varying fields, researchers struggle with tools for exploring and analyzing these structures. We describe GUESS, a novel system for grap...
Eytan Adar
IPPS
2007
IEEE
16 years 29 days ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis