5100 search results - page 352 / 1020 » The Linear Complexity of a Graph |
119
click to vote
FOCM
2010
15 years 2 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
130
click to vote
HCI
2009
15 years 2 months ago
2009
Abstract. The P300 Speller has proven to be an effective paradigm for braincomputer interface (BCI) communication. Using this paradigm, studies have shown that a simple linear clas...
160
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
143
Voted
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
133
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...