2294 search results - page 297 / 459 » From Path Graphs to Directed Path Graphs |
128
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
148
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
136
Voted
DAC
2004
ACM
15 years 8 months ago
2004
ACM
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
115
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
116
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...