Sciweavers

1507 search results - page 172 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
DCC
2008
IEEE
14 years 9 months ago
From graph states to two-graph states
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...
SIAMJO
2008
74views more  SIAMJO 2008»
13 years 10 months ago
Lagrangian-Dual Functions and Moreau--Yosida Regularization
In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function . This prope...
Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Sou...
CSR
2008
Springer
13 years 10 months ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky
JPDC
2000
106views more  JPDC 2000»
13 years 10 months ago
Dual of a Complete Graph as an Interconnection Network
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
Si-Qing Zheng, Jie Wu
ICSM
2007
IEEE
14 years 4 months ago
Package Surface Blueprints: Visually Supporting the Understanding of Package Relationships
Large object-oriented applications are structured over large number of packages. Packages are important but complex structural entities that may be difficult to understand since ...
Stéphane Ducasse, Damien Pollet, Mathieu Su...