Sciweavers

1199 search results - page 160 / 240
» How to Compare the Power of Computational Models
Sort
View
IEEESP
2010
99views more  IEEESP 2010»
15 years 4 months ago
The Iterated Weakest Link
Abstract. We devise a model for security investment that reflects dynamic interaction between a defender, who faces uncertainty, and an attacker, who repeatedly targets the weakes...
Rainer Böhme, Tyler Moore
ECCV
2008
Springer
16 years 8 months ago
Learning Optical Flow
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
Deqing Sun, Stefan Roth, J. P. Lewis, Michael J. B...
CP
2005
Springer
15 years 12 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
TON
2010
175views more  TON 2010»
15 years 1 months ago
Cooperative Adaptive Spectrum Sharing in Cognitive Radio Networks
The cognitive radio (CR) paradigm calls for open spectrum access according to a predetermined etiquette. Under this paradigm, CR nodes access the spectrum opportunistically by cont...
Haythem Bany Salameh, Marwan Krunz, Ossama Younis
BMCBI
2006
143views more  BMCBI 2006»
15 years 6 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...