Sciweavers

3105 search results - page 163 / 621
» The Path-Packing Structure of Graphs
Sort
View
145
Voted
CVPR
2011
IEEE
14 years 7 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
ICCV
2011
IEEE
14 years 3 months ago
Probabilistic Group-Level Motion Analysis and Scenario Recognition
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
Ming-Ching Chang, Nils Krahnstoever, Weina Ge
111
Voted
CIKM
2011
Springer
14 years 3 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
Mo Zhou, Yifan Pan, Yuqing Wu
168
Voted
WSDM
2012
ACM
245views Data Mining» more  WSDM 2012»
13 years 11 months ago
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
Brian Thompson
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 10 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...