2080 search results - page 16 / 416 » Measuring empirical computational complexity |
BMCBI
2007
13 years 9 months ago
2007
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
ECAL
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We quantify the local information dynamics at each spatiotemporal point in a complex system in terms of each element of computation: information storage, transfer and mod...
NIPS
2008
13 years 11 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
TMC
2008
13 years 9 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
MKM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Many processes in mathematical computing try to use knowledge of the most desired forms of mathematical expressions. This occurs, for example, in symbolic computation sys...