Sciweavers

1816 search results - page 13 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 2 months ago
A new multi-view regression approach with an application to customer wallet estimation
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
Srujana Merugu, Saharon Rosset, Claudia Perlich
SIBGRAPI
2005
IEEE
15 years 7 months ago
A Maximum Uncertainty LDA-Based Approach for Limited Sample Size Problems : With Application to Face Recognition
A critical issue of applying Linear Discriminant Analysis (LDA) is both the singularity and instability of the within-class scatter matrix. In practice, particularly in image recog...
Carlos E. Thomaz, Duncan Fyfe Gillies
EOR
2006
130views more  EOR 2006»
15 years 1 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 2 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 7 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao