697 search results - page 47 / 140 » On the Theory of Average Case Complexity |
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
VTC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Channel-adaptive techniques increase the efficiency of wireless communications, as they are efficient in coping with the quality variation of the wireless channels. However, ...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...