Sciweavers

1814 search results - page 28 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 3 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
MICCAI
2001
Springer
14 years 1 months ago
Multisubject Non-rigid Registration of Brain MRI Using Intensity and Geometric Features
In this article we merge point feature and intensity-based registration in a single algorithm to tackle the problem of multiple brain registration. Because of the high variability ...
Pascal Cachier, Jean-Francois Mangin, Xavier Penne...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 3 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
COR
2011
13 years 4 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria