Sciweavers

693 search results - page 24 / 139
» Categorical Properties of The Complex Numbers
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 7 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
BMCBI
2007
102views more  BMCBI 2007»
13 years 7 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
ICPR
2008
IEEE
14 years 8 months ago
Wavelet-based salient points with scale information for classification
The calculation of local features at points of interest is a vital part of many current image retrieval and object detection systems. The wavelet-based interest point detector by ...
Alexandra Teynor, Hans Burkhardt
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 7 months ago
Compactly accessible categories and quantum key distribution
Abstract. Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based con...
Chris Heunen
ICLP
2004
Springer
14 years 27 days ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia