Sciweavers

5608 search results - page 251 / 1122
» On the Theory of Matchgate Computations
Sort
View
LICS
2009
IEEE
16 years 1 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
GBRPR
2009
Springer
16 years 1 months ago
On Computing Canonical Subsets of Graph-Based Behavioral Representations
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
IROS
2008
IEEE
131views Robotics» more  IROS 2008»
16 years 1 months ago
Deformations of general parametric shells: Computation and robot experiment
— A shell is a body enclosed between two closely spaced and curved surfaces. Classical theory of shells [38], [33], [16] assumes a parametrization along the lines of principal cu...
Yan-Bin Jia, Jiang Tian
ISW
2007
Springer
16 years 24 days ago
On the Concept of Software Obfuscation in Computer Security
Abstract. Program obfuscation is a semantic-preserving transformation aimed at bringing a program into such a form, which impedes the understanding of its algorithm and data struct...
Nikolay Kuzurin, Alexander Shokurov, Nikolay P. Va...
TARK
2007
Springer
16 years 23 days ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein