14829 search results - page 30 / 2966 » How Many Different |
118
Voted
JCT
2007
15 years 2 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
100
Voted
IACR
2011
14 years 2 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
120
Voted
CIE
2008
Springer
15 years 4 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
117
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
117
click to vote
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
We illustrate how to consider a network of cameras as a single generalized camera in a framework proposed by Nayar [13]. We derive the discrete structure from motion equations for...