16430 search results - page 343 / 3286 » On Computable Tree Functions |
192
click to vote
PPOPP
2011
ACM
14 years 7 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
172
click to vote
DSN
2011
IEEE
14 years 4 months ago
2011
IEEE
—We consider the problem of inferring link loss rates using passive measurements. Prior inference approaches are mainly built on the time correlation nature of packet losses. How...
217
click to vote
RECOMB
2012
Springer
13 years 7 months ago
2012
Springer
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
137
Voted
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
122
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper we address the problem of multimodal registration of coronary vessels by developing a 3D parametrical model of vessel trees from computer tomography data and registe...