3946 search results - page 241 / 790 » The computational complexity of choice sets |
185
click to vote
TGC
2007
Springer
16 years 24 days ago
2007
Springer
Distributed applications can be structured using sessions that specify flows of messages between roles. We design a small specific language to declare sessions. We then build a c...
256
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
154
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
201
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...
166
Voted
ICCV
1998
IEEE
16 years 8 months ago
1998
IEEE
This paper presents a method for alignment of images acquired by sensors of di erent modalities (e.g., EO and IR). The paper has two main contributions: (i) It identi es an approp...