3008 search results - page 94 / 602 » Independence in connected graphs |
169
click to vote
BMCV
2000
Springer
15 years 10 months ago
2000
Springer
We here describe a view-based system for the pose-independent representation of objects without making reference to 3-D models. Input to the system is a collection of pictures cov...
157
click to vote
ISIM
2007
15 years 7 months ago
2007
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
616
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
150
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
153
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...