1326 search results - page 224 / 266 » Approximate Tree Kernels |
120
click to vote
JMLR
2006
15 years 1 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
117
Voted
TIT
2008
15 years 1 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
132
click to vote
TSP
2008
15 years 1 months ago
2008
In Part I ["The shiftable complex directional pyramid--Part I: Theoretical Aspects," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 56, no. 10, October 2008], we proposed a...
88
Voted
FOCM
2010
15 years 15 days ago
2010
We show how B-series may be used to derive in a systematic way the analytical expressions of the high-order stroboscopic averaged equations that approximate the slow dynamics of h...
163
click to vote
SPIRE
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...