1523 search results - page 274 / 305 » The Computational Complexity of Linear Optics |
GIS
2009
ACM
14 years 8 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
Humanoid robots are high-dimensional movement systems for which analytical system identification and control methods are insufficient due to unknown nonlinearities in the system s...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
KDD
1999
ACM
13 years 12 months ago
1999
ACM
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
BMCBI
2008
13 years 7 months ago
2008
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...