356 search results - page 32 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
101
Voted
AAAI
1996
15 years 1 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
96
Voted
TNN
1998
15 years 1 days ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
109
click to vote
WWW
2011
ACM
14 years 7 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
127
click to vote
ECCV
1994
Springer
16 years 2 months ago
1994
Springer
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
122
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...