Sciweavers

1933 search results - page 49 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
JSS
2008
157views more  JSS 2008»
13 years 8 months ago
Can k-NN imputation improve the performance of C4.5 with small software project data sets? A comparative evaluation
Missing data is a widespread problem that can affect the ability to use data to construct effective prediction systems. We investigate a common machine learning technique that can...
Qinbao Song, Martin J. Shepperd, Xiangru Chen, Jun...
ENDM
2008
142views more  ENDM 2008»
13 years 8 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
Improved Randomized Results for That Interval Selection Problem
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
Leah Epstein, Asaf Levin
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...
ICIP
2001
IEEE
14 years 10 months ago
Image retrieval with relevance feedback: from heuristic weight adjustment to optimal learning methods
Various relevance feedback algorithms have been proposed in recent years in the area of content-based image retrieval. This paper gives a brief review and analysis on existing tec...
Xiang Sean Zhou, Thomas S. Huang