Sciweavers

22 search results - page 4 / 5
» A combinatorial approach to conceptual graph projection chec...
Sort
View
FCA
2005
Springer
207views Formal Methods» more  FCA 2005»
13 years 11 months ago
From Formal Concept Analysis to Contextual Logic
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
Frithjof Dau, Julia Klinger
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 6 months ago
The PCP theorem by gap amplification
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...
Irit Dinur
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 6 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
SIGGRAPH
2009
ACM
14 years 8 days ago
Spectral mesh processing
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
Bruno Lévy, Hao Zhang 0002
CVGIP
2007
99views more  CVGIP 2007»
13 years 5 months ago
Meshless geometric subdivision
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
Carsten Moenning, Facundo Mémoli, Guillermo...