Sciweavers

76 search results - page 10 / 16
» Linear-Time Ranking of Permutations
Sort
View
CIKM
2007
Springer
13 years 11 months ago
A comparison of statistical significance tests for information retrieval evaluation
Information retrieval (IR) researchers commonly use three tests of statistical significance: the Student's paired t-test, the Wilcoxon signed rank test, and the sign test. Ot...
Mark D. Smucker, James Allan, Ben Carterette
JUCS
2002
91views more  JUCS 2002»
13 years 7 months ago
On Quasi-Products of Tree Automata
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
Ferenc Gécseg
DM
1999
145views more  DM 1999»
13 years 7 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
13 years 11 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht