Sciweavers

2069 search results - page 210 / 414
» Linear time algorithms for Clobber
Sort
View
AOR
2006
77views more  AOR 2006»
15 years 6 months ago
Preemptive Scheduling with Position Costs
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
Francis Sourd
CG
2006
Springer
15 years 6 months ago
Drawing lines by uniform packing
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. Whi...
Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakh...
JCSS
2008
62views more  JCSS 2008»
15 years 6 months ago
Maximal repetitions in strings
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
Maxime Crochemore, Lucian Ilie
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 6 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
KDD
2004
ACM
179views Data Mining» more  KDD 2004»
16 years 7 months ago
1-dimensional splines as building blocks for improving accuracy of risk outcomes models
Transformation of both the response variable and the predictors is commonly used in fitting regression models. However, these transformation methods do not always provide the maxi...
David S. Vogel, Morgan C. Wang