Sciweavers

4131 search results - page 77 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
IPCO
2007
94views Optimization» more  IPCO 2007»
15 years 4 months ago
Infrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Barbara M. Anthony, Anupam Gupta
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 8 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
DAM
2008
88views more  DAM 2008»
15 years 3 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
ICTIR
2009
Springer
15 years 9 months ago
"A term is known by the company it keeps": On Selecting a Good Expansion Set in Pseudo-Relevance Feedback
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
Raghavendra Udupa, Abhijit Bhole, Pushpak Bhattach...
ICML
2005
IEEE
16 years 3 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai