151 search results - page 6 / 31 » Computing in Solvable Matrix Groups |
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
Speaker change detection is most commonly done by statistically determining whether the two adjacent segments of a speech stream are significantly different or not. In this paper, ...
IPCO
2007
15 years 3 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
116
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
ICPR
2002
IEEE
16 years 2 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
115
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
The geometry of two uncalibrated views obtained with a parabolic catadioptric device is the subject of this paper. We introduce the notion of circle space, a natural representation...