Sciweavers

4536 search results - page 81 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CONEXT
2009
ACM
13 years 10 months ago
MDCube: a high performance network structure for modular data center interconnection
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
Haitao Wu, Guohan Lu, Dan Li, Chuanxiong Guo, Yong...
BMCBI
2005
151views more  BMCBI 2005»
13 years 9 months ago
stam - a Bioconductor compliant R package for structured analysis of microarray data
Background: Genome wide microarray studies have the potential to unveil novel disease entities. Clinically homogeneous groups of patients can have diverse gene expression profiles...
Claudio Lottaz, Rainer Spang
IS
2010
13 years 7 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
SIAMIS
2010
171views more  SIAMIS 2010»
13 years 3 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 10 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...