1101 search results - page 178 / 221 » An Algorithm for the Graph Crossing Number Problem |
141
click to vote
FCT
2005
Springer
15 years 7 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
110
click to vote
IJFCS
1998
15 years 1 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
110
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
129
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
121
click to vote
PRL
2010
15 years 10 days ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...