4377 search results - page 106 / 876 » Mass problems and randomness |
175
click to vote
NIPS
2008
15 years 7 months ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
170
click to vote
EMNLP
2004
15 years 7 months ago
2004
This paper presents Japanese morphological analysis based on conditional random fields (CRFs). Previous work in CRFs assumed that observation sequence (word) boundaries were fixed...
137
click to vote
APPROX
2009
Springer
16 years 4 days ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
145
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
138
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...