Sciweavers

2107 search results - page 182 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
IEEECGIV
2009
IEEE
16 years 1 months ago
Two Dimensional Compressive Classifier for Sparse Images
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
Armin Eftekhari, Hamid Abrishami Moghaddam, Massou...
ACL
2010
15 years 4 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
ECCV
2010
Springer
15 years 11 months ago
Fast Covariance Computation and Dimensionality Reduction for Sub-Window Features in Images
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
PR
2006
101views more  PR 2006»
15 years 6 months ago
Efficient Legendre moment computation for grey level images
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
G. Y. Yang, Huazhong Shu, Christine Toumoulin, Guo...
MFCS
2009
Springer
15 years 11 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn