Sciweavers

83 search results - page 5 / 17
» Improving the Efficiency of Sorting by Reversals
Sort
View
BMCBI
2005
178views more  BMCBI 2005»
13 years 7 months ago
A quantization method based on threshold optimization for microarray short time series
Background: Reconstructing regulatory networks from gene expression profiles is a challenging problem of functional genomics. In microarray studies the number of samples is often ...
Barbara Di Camillo, Fatima Sanchez-Cabo, Gianna To...
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ICIP
2002
IEEE
14 years 8 months ago
Reversible data hiding
We present a novel reversible (lossless) data hiding (embedding) technique, which enables the exact recovery of the original host signal upon extraction of the embedded informatio...
Mehmet Utku Celik, Gaurav Sharma, Eli Saber, A. Mu...
CAD
2004
Springer
13 years 7 months ago
Choosing consistent constraints for beautification of reverse engineered geometric models
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...
IPPS
1998
IEEE
13 years 11 months ago
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
Koji Nakano, Stephan Olariu, James L. Schwing