Sciweavers

68 search results - page 13 / 14
» Open Graphs and Monoidal Theories
Sort
View
SIGGRAPH
2009
ACM
14 years 2 months 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
ICALP
2004
Springer
14 years 27 days ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
OPODIS
2004
13 years 9 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
FOCS
2009
IEEE
14 years 2 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...