Sciweavers

1814 search results - page 74 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ATMOS
2007
129views Optimization» more  ATMOS 2007»
13 years 11 months ago
Solving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
BMCBI
2007
144views more  BMCBI 2007»
13 years 10 months ago
Motif kernel generated by genetic programming improves remote homology and fold detection
Background: Protein remote homology detection is a central problem in computational biology. Most recent methods train support vector machines to discriminate between related and ...
Tony Håndstad, Arne J. H. Hestnes, Pål...
TC
1998
13 years 9 months ago
An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
Guohua Jin, Zhiyuan Li, Fujie Chen
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 12 months ago
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
We present a new streaming algorithm for maintaining an -kernel of a point set in Rd using O((1/(d-1)/2 ) log(1/)) space. The space used by our algorithm is optimal up to a small ...
Hamid Zarrabi-Zadeh
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
13 years 11 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein