Sciweavers

108 search results - page 21 / 22
» cn 2010
Sort
View
MST
2010
103views more  MST 2010»
13 years 5 months ago
Border Correlations of Partial Words
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
Francine Blanchet-Sadri, E. Clader, O. Simpson
TMC
2010
119views more  TMC 2010»
13 years 5 months ago
SSUM: Smart Server Update Mechanism for Maintaining Cache Consistency in Mobile Environments
—This paper proposes a cache consistency scheme based on a previously proposed architecture for caching database data in MANETs. The original scheme for data caching stores the q...
Khaleel W. Mershad, Hassan Artail
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 3 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
BMCBI
2010
106views more  BMCBI 2010»
13 years 7 months ago
TumorBoost: Normalization of allele-specific tumor copy numbers from a single pair of tumor-normal genotyping microarrays
Background: High-throughput genotyping microarrays assess both total DNA copy number and allelic composition, which makes them a tool of choice for copy number studies in cancer, ...
Henrik Bengtsson, Pierre Neuvial, Terence P. Speed
ENDM
2007
88views more  ENDM 2007»
13 years 7 months ago
Graph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
Nathan Linial, Jirí Matousek, Or Sheffet, G...