252 search results - page 38 / 51 » Decremental Clique Problem |
IPCO
2008
14 years 11 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
IADIS
2004
14 years 11 months ago
2004
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
91
Voted
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
118
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
LCTRTS
2007
Springer
15 years 3 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...