Sciweavers

2004 search results - page 320 / 401
» Sampling from large graphs
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 11 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ANLP
2000
141views more  ANLP 2000»
13 years 11 months ago
Aggressive Morphology for Robust Lexical Coverage
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
William A. Woods
ALMOB
2008
112views more  ALMOB 2008»
13 years 10 months ago
Metabolite-based clustering and visualization of mass spectrometry data using one-dimensional self-organizing maps
Background: One of the goals of global metabolomic analysis is to identify metabolic markers that are hidden within a large background of data originating from high-throughput ana...
Peter Meinicke, Thomas Lingner, Alexander Kaever, ...
BMCBI
2010
112views more  BMCBI 2010»
13 years 10 months ago
TabSQL: a MySQL tool to facilitate mapping user data to public databases
Background: With advances in high-throughput genomics and proteomics, it is challenging for biologists to deal with large data files and to map their data to annotations in public...
Xiaoqin Xia, Michael McClelland, Yipeng Wang
BMCBI
2008
138views more  BMCBI 2008»
13 years 10 months ago
Inference of haplotypic phase and missing genotypes in polyploid organisms and variable copy number genomic regions
Background: The power of haplotype-based methods for association studies, identification of regions under selection, and ancestral inference, is well-established for diploid organ...
Shu-Yi Su, Jonathan White, David J. Balding, Lachl...