1732 search results - page 62 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
181
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper proposes a novel approach for rank level fusion which gives improved performance gain verified by experimental results. In the absence of ranked features and instead of...
152
click to vote
SBACPAD
2007
IEEE
16 years 16 days ago
2007
IEEE
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
158
click to vote
INFOCOM
2007
IEEE
16 years 17 days ago
2007
IEEE
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...
145
click to vote
CPM
2001
Springer
15 years 10 months ago
2001
Springer
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
164
click to vote
JGT
2011
15 years 1 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...