Sciweavers

401 search results - page 72 / 81
» Sparse Quasi-Random Graphs
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Segmentation by transduction
This paper addresses the problem of segmenting an image into regions consistent with user-supplied seeds (e.g., a sparse set of broad brush strokes). We view this task as a statis...
Florent Ségonne, Jean Ponce, Jean-Yves Audi...
ICML
2006
IEEE
14 years 8 months ago
Pachinko allocation: DAG-structured mixture models of topic correlations
Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. However, LDA does not ca...
Wei Li, Andrew McCallum
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
14 years 8 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
CIKM
2009
Springer
14 years 2 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
FSTTCS
2009
Springer
14 years 2 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya