Sciweavers

2310 search results - page 173 / 462
» Coloring Random Graphs
Sort
View
ICIP
2009
IEEE
15 years 6 days ago
Graph-based foreground extraction in extended color space
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
Hansung Kim, Adrian Hilton
MCPR2
2011
104views more  MCPR2 2011»
14 years 5 months ago
People Detection Using Color and Depth Images
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
Joaquín Salas, Carlo Tomasi
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
15 years 3 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
PVLDB
2010
200views more  PVLDB 2010»
15 years 26 days ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
110
Voted
ICML
2010
IEEE
15 years 3 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long