Sciweavers

2661 search results - page 231 / 533
» Quantum Complexity Classes
Sort
View
STACS
2007
Springer
15 years 10 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
AOSE
2005
Springer
15 years 9 months ago
Zooming Multi-Agent Systems
Abstract Complex systems call for a hierarchical description. Analogously, the engineering of non-trivial MASs (multiagent systems) requires principles and mechanisms for a multi-l...
Ambra Molesini, Andrea Omicini, Alessandro Ricci, ...
COMPGEOM
2008
ACM
15 years 5 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
BMCBI
2007
130views more  BMCBI 2007»
15 years 4 months ago
Exploiting residue-level and profile-level interface propensities for usage in binding sites prediction of proteins
Background: Recognition of binding sites in proteins is a direct computational approach to the characterization of proteins in terms of biological and biochemical function. Residu...
Qiwen Dong, Xiaolong Wang, Lei Lin, Yi Guan
CVPR
1996
IEEE
16 years 6 months ago
Minimal operator set for passive depth from defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
Masahiro Watanabe, Shree K. Nayar