1101 search results - page 91 / 221 » An Algorithm for the Graph Crossing Number Problem |
158
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
135
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
132
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
275
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
154
click to vote
GBRPR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....