2735 search results - page 366 / 547 » Comparing notions of randomness |
144
Voted
CMOT
2004
15 years 3 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
193
Voted
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
126
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We present a new method for training deformable models. Assume that we have training images where part locations have been labeled. Typically, one fits a model by maximizing the l...
129
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Assumptions of brightness constancy and spatial smoothness underlie most optical flow estimation methods. In contrast to standard heuristic formulations, we learn a statistical mod...
113
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...