Sciweavers

1142 search results - page 111 / 229
» Approximability of Clausal Constraints
Sort
View
IJCV
2010
194views more  IJCV 2010»
15 years 4 months ago
Improving Bag-of-Features for Large Scale Image Search
This article improves recent methods for large scale image search. We first analyze the bag-of-features approach in the framework of approximate nearest neighbor search. This lea...
Herve Jegou, Matthijs Douze, Cordelia Schmid
WCNC
2010
IEEE
15 years 4 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
ORL
2006
105views more  ORL 2006»
15 years 6 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
ICASSP
2008
IEEE
16 years 27 days ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
CONTEXT
2007
Springer
16 years 19 days ago
Contexts and Ontologies in Schema Matching
Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
Paolo Bouquet