Sciweavers

288 search results - page 23 / 58
» Notes on computing minimal approximant bases
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CVPR
2004
IEEE
14 years 12 months ago
Window-Based, Discontinuity Preserving Stereo
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
Motilal Agrawal, Larry S. Davis
CVPR
2008
IEEE
14 years 12 months ago
Taylor expansion based classifier adaptation: Application to person detection
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
Cha Zhang, Raffay Hamid, Zhengyou Zhang
MOR
2006
95views more  MOR 2006»
13 years 9 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ICC
2007
IEEE
14 years 4 months ago
Linear Precoding with Minimum BER Criterion for MIMO-OFDM Systems Employing ML Detection
Abstract— This paper proposes a new MIMO-OFDM precoding method that minimizes BER of the maximum likelihood detection (MLD). Conventional MIMO precoding methods can approximately...
Boonsarn Pitakdumrongkija, Kazuhiko Fukawa, Hirosh...