Sciweavers

829 search results - page 80 / 166
» Distance domination-critical graphs
Sort
View
DM
2008
88views more  DM 2008»
14 years 12 months ago
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
Tobias Müller, Attila Pór, Jean-S&eacu...
ICML
2007
IEEE
16 years 21 days ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
CVPR
2010
IEEE
15 years 8 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
MCAM
2007
Springer
238views Multimedia» more  MCAM 2007»
15 years 6 months ago
A Three-Level Scheme for Real-Time Ball Tracking
A three-level method is proposed to achieve robust and real-time ball tracking in soccer videos. It includes object-, intra-trajectory-, and intertrajectory-level processing. Due t...
Xiaofeng Tong, Tao Wang, Wenlong Li, Yimin Zhang, ...
KCAP
2003
ACM
15 years 5 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker