Sciweavers

234 search results - page 22 / 47
» Looks good to me
Sort
View
EOR
2008
91views more  EOR 2008»
13 years 11 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
CANDC
2000
ACM
13 years 10 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
CORR
2002
Springer
118views Education» more  CORR 2002»
13 years 10 months ago
Unsupervised discovery of morphologically related words based on orthographic and semantic similarity
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to di...
Marco Baroni, Johannes Matiasek, Harald Trost
JCD
2002
70views more  JCD 2002»
13 years 10 months ago
Quality technical information: paving the way for usable print and web interface design
Principles of information style and design have been around for years. Look at the shelf life of Strunk and White's classic Elements of Style, published in 1959 and still a b...
Theo Mandel
TIT
2002
57views more  TIT 2002»
13 years 10 months ago
Writing sequences on the plane
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
Emina Soljanin