4315 search results - page 45 / 863 » Sorting in linear time |
100
Voted
JASIS
2010
15 years 1 months ago
2010
Common measures of term importance in information retrieval (IR) rely on counts of term frequency; rare terms receive higher weight in document ranking than common terms receive. ...
118
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
120
Voted
AUTOMATICA
2008
15 years 2 months ago
2008
In this paper we consider the asymptotic stability of a class of discrete-time switching linear systems, where each of the constituent subsystems is Schur stable. We first present...
141
Voted
OPODIS
2001
15 years 4 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
94
Voted
ACL
2009
15 years 17 days ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...