1132 search results - page 101 / 227 » Similarity Graphs |
DM
2010
14 years 10 months ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a graph-based approach for spoken term detection. Each first-pass retrieved utterance is a node on a graph and the edge between two nodes is weighted by the s...
CVPR
2006
IEEE
15 years 12 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
115
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...