Sciweavers

135 search results - page 26 / 27
» Minimizing the Project Cost with Generalized Precedence Rela...
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
TNN
2011
200views more  TNN 2011»
15 years 1 months ago
Domain Adaptation via Transfer Component Analysis
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
Sinno Jialin Pan, Ivor W. Tsang, James T. Kwok, Qi...
SIGSOFT
2007
ACM
16 years 7 months ago
Training on errors experiment to detect fault-prone software modules by spam filter
The fault-prone module detection in source code is of importance for assurance of software quality. Most of previous fault-prone detection approaches are based on software metrics...
Osamu Mizuno, Tohru Kikuno
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 28 days ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking