2485 search results - page 135 / 497 » Time Bounded Frequency Computations |
157
Voted
SPDP
1993
IEEE
15 years 9 months ago
1993
IEEE
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
134
click to vote
WABI
2009
Springer
15 years 11 months ago
2009
Springer
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
149
Voted
JMLR
2006
15 years 5 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
143
Voted
SIROCCO
2000
15 years 6 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
147
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...