Sciweavers

3897 search results - page 120 / 780
» complexity 2010
Sort
View
CCDS
2010
122views more  CCDS 2010»
13 years 7 months ago
The problem of mutually unbiased bases in dimension 6
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
Philippe Jaming, Máté Matolcsi, P&ea...
BMCBI
2010
105views more  BMCBI 2010»
13 years 10 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
SIMPAR
2010
110views Robotics» more  SIMPAR 2010»
13 years 8 months ago
Improving a Robotics Framework with Real-Time and High-Performance Features
Middleware has a key role in modern and object-oriented robotics frameworks, which aim at developing reusable, scalable and maintainable systems using different platforms and prog...
Jesús Martínez, Adrián Romero...
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
13 years 5 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 10 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak