Sciweavers

1095 search results - page 202 / 219
» Modeling High-Order Dependencies in Local Appearance Models
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CSCW
2012
ACM
12 years 4 months ago
Towards self-optimizing collaborative systems
Two important performance metrics in collaborative systems are local and remote response times. Previous analytical and simulation work has shown that these response times depend ...
Sasa Junuzovic, Prasun Dewan
BTW
2005
Springer
113views Database» more  BTW 2005»
14 years 2 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...
WOTUG
2007
13 years 9 months ago
Concurrency Control and Recovery Management for Open e-Business Transactions
Concurrency control mechanisms such as turn-taking, locking, serialization, transactional locking mechanism, and operational transformation try to provide data consistency when con...
Amir R. Razavi, Sotiris Moschoyiannis, Paul J. Kra...
BMCBI
2007
202views more  BMCBI 2007»
13 years 8 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...