1933 search results - page 74 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
123
Voted
ICNC
2009
Springer
15 years 10 months ago
2009
Springer
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
147
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
120
Voted
PASTE
2004
ACM
15 years 9 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
161
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
150
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...