5889 search results - page 323 / 1178 » Graph Layout Problems |
186
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
169
click to vote
JUCS
2007
15 years 6 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
169
Voted
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
172
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
171
click to vote
WABI
2007
Springer
16 years 25 days ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...