Sciweavers

1115 search results - page 70 / 223
» Separating Shape Graphs
Sort
View
CVPR
2008
IEEE
16 years 4 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...
WG
2010
Springer
15 years 23 days ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
109
Voted
SCL
2010
102views more  SCL 2010»
15 years 24 days ago
Distributed control of triangular formations with angle-only constraints
—This paper considers the coupled formation control of three mobile agents moving in the plane. Each agent has only local inter-agent bearing knowledge and is required to maintai...
Meysam Basiri, Adrian N. Bishop, Patric Jensfelt
ICCV
2009
IEEE
15 years 5 days ago
Estimating human shape and pose from a single image
We describe a solution to the challenging problem of estimating human body shape from a single photograph or painting. Our approach computes shape and pose parameters of a 3D huma...
Peng Guan, Alexander Weiss, Alexandru O. Balan, Mi...
124
Voted
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
15 years 11 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...