1732 search results - page 53 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
151
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
160
click to vote
SPEAKERC
2007
Springer
16 years 9 days ago
2007
Springer
Higher-level features based on linguistic or long-range information have attracted significant attention in automatic speaker recognition. This article briefly summarizes approac...
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Varying channel conditions present a difficult problem for many speech technologies such as language identification (LID). Channel compensation techniques have been shown to sig...
181
click to vote
JCT
2010
15 years 4 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
171
click to vote
JGT
2006
15 years 6 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...