Sciweavers

161 search results - page 19 / 33
» Methods for convex and general quadratic programming
Sort
View
MM
2009
ACM
187views Multimedia» more  MM 2009»
15 years 9 months ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...
ICASSP
2008
IEEE
15 years 11 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
CVPR
2012
IEEE
13 years 6 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
15 years 5 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs
ECOOP
1997
Springer
15 years 8 months ago
Feature-Oriented Programming: A Fresh Look at Objects
We propose a new model for exible composition of objects et of features. Features are similar to (abstract) subclasses, but only provide the core functionality of a (sub)class. Ove...
Christian Prehofer