5615 search results - page 921 / 1123 » On the Computational Capabilities of Several Models |
198
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Efforts to predict functional sites from globular proteins is increasingly common; however, the most successful of these methods generally require structural insight. ...
235
click to vote
IANDC
2011
15 years 2 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
237
click to vote
ICPPW
2009
IEEE
16 years 1 months ago
2009
IEEE
—Despite many technology advances, the limited computing power of sensors encumber them from taking part in service-oriented architectures. In recent years, the sensornetworking ...
215
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
214
click to vote
IPPS
2005
IEEE
16 years 23 days ago
2005
IEEE
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...