165 search results - page 15 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
129
click to vote
MOC
1998
14 years 11 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
ICLP
1997
Springer
15 years 3 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
107
click to vote
NIPS
2004
15 years 1 months ago
2004
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
191
click to vote
ICDT
2009
ACM
16 years 11 days ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...