1391 search results - page 180 / 279 » Complexity Limitations on Quantum Computation |
SIGGRAPH
1992
ACM
14 years 5 days ago
1992
ACM
We present a new approachto interactive modeling of freeform surfaces. Instead of a fixed mesh of control points, the model presented to the user is that of an infinitely malleabl...
DEBS
2007
ACM
14 years 2 days ago
2007
ACM
Over the last decade a wide range of publish/subscribe (pub/ sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, whic...
PODC
2010
ACM
14 years 18 hour ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
EUROPAR
2004
Springer
13 years 12 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
CONCUR
2006
Springer
13 years 12 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...