Sciweavers

2698 search results - page 162 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
INFORMATICALT
2002
140views more  INFORMATICALT 2002»
15 years 6 months ago
Intelligent Initial Finite Element Mesh Generation for Solutions of 2D Problems
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
Lina Vasiliauskiene, Romualdas Bausys
ICALP
2011
Springer
14 years 10 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
14 years 6 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ICTIR
2009
Springer
16 years 1 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...