15073 search results - page 137 / 3015 » Probabilistic algorithms for computing resultants |
136
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
124
Voted
NAACL
2010
15 years 1 months ago
2010
This paper contributes a formalization of frame-semantic parsing as a structure prediction problem and describes an implemented parser that transforms an English sentence into a f...
133
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
123
Voted
PR
2008
15 years 3 months ago
2008
Given the pervasive nature of malicious mobile code (viruses, worms, etc.), developing statistical/structural models of code execution is of considerable importance. We investigat...
135
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...