389 search results - page 32 / 78 » Some natural decision problems in automatic graphs |
165
click to vote
GD
2005
Springer
16 years 3 days ago
2005
Springer
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
193
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
183
click to vote
TCS
2010
15 years 5 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
205
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
203
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
This paper addresses the problem of automatically retrieving answers for how-to questions, focusing on those that inquire about the procedure for achieving a specific goal. For su...