3235 search results - page 119 / 647 » Partial Redundant Modeling |
151
click to vote
CVPR
2010
IEEE
16 years 21 days ago
2010
IEEE
We describe a general method for building cascade classifiers from part-based deformable models such as pictorial structures. We focus primarily on the case of star-structured mod...
150
click to vote
EMNLP
2010
15 years 2 months ago
2010
We show that the standard beam-search algorithm can be used as an efficient decoder for the global linear model of Zhang and Clark (2008) for joint word segmentation and POS-taggi...
126
click to vote
PAKDD
2010
ACM
15 years 9 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
147
Voted
ENDM
2010
15 years 4 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
139
click to vote
PKC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...