Sciweavers

6142 search results - page 768 / 1229
» The Complexity of Partition Functions
Sort
View
PLDI
2011
ACM
14 years 9 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
POPL
2012
ACM
14 years 2 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
DIMACS
1996
15 years 8 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
CVPR
2009
IEEE
17 years 2 months ago
Recognizing Indoor Scenes
We propose a scheme for indoor place identi cation based on the recognition of global scene views. Scene views are encoded using a holistic representation that provides low-resolu...
Antonio B. Torralba, Ariadna Quattoni
GRAPP
2009
16 years 10 months ago
Skeleton-based Rigid Skinning for Character Animation
Skeleton-based skinning is widely used for realistic animation of complex characters defining mesh movement as a function of the underlying skeleton. In this paper, we propose a ne...
Andreas Vasilakis, Ioannis Fudos