5100 search results - page 595 / 1020 » The Linear Complexity of a Graph |
199
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
152
click to vote
MLG
2007
Springer
16 years 28 days ago
2007
Springer
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
203
click to vote
CGF
2007
15 years 6 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
199
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...