Sciweavers

426 search results - page 16 / 86
» Run lengths and liquidity
Sort
View
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
13 years 9 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx
JC
2007
119views more  JC 2007»
13 years 9 months ago
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
Martin Avendano, Teresa Krick, Martín Sombr...
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 1 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
AUIC
2006
IEEE
14 years 3 months ago
A wearable fatigue monitoring system: application of human-computer interaction evaluation
We developed a wearable fatigue monitoring system with a high-sensitivity 2-axis accelerometer and an on-board signal processing microcontroller. The proposed system measures fain...
Soichiro Matsushita, Ayumi Shiba, Kan Nagashima
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
14 years 1 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid