120
Voted
BMVC
2010
15 years 19 days ago
2010
We propose a novel directed graphical model for label propagation in lengthy and complex video sequences. Given hand-labelled start and end frames of a video sequence, a variation...
140
Voted
ACL
2010
15 years 19 days ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
119
Voted
ACL
2010
15 years 19 days ago
2010
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
106
Voted
MST
2010
15 years 1 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
138
Voted
MICAI
2010
Springer
2010
Springer
Combining Neural Networks Based on Dempster-Shafer Theory for Classifying Data with Imperfect Labels
15 years 1 months ago
This paper addresses the supervised learning in which the class membership of training data are subject to uncertainty. This problem is tackled in the framework of the Dempster-Sha...
112
Voted
JOCN
2010
15 years 1 months ago
2010
■ Whether verbal labels help infants visually process and categorize objects is a contentious issue. Using electroencephalography, we investigated whether possessing familiar or...
117
Voted
COMGEO
1999
ACM
15 years 2 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
129
Voted
IPL
2002
15 years 2 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
110
click to vote
DM
2002
15 years 2 months ago
2002
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2,
110
Voted
TVCG
2008
15 years 2 months ago
2008
In this paper we introduce a technique for applying textual labels to 3D surfaces. An effective labeling must balance the conflicting goals of conveying the shape of the surface wh...