Sciweavers

425 search results - page 23 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
99
Voted
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
BMCBI
2006
100views more  BMCBI 2006»
14 years 9 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
DATAMINE
2007
135views more  DATAMINE 2007»
14 years 9 months ago
Experiencing SAX: a novel symbolic representation of time series
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...
Jessica Lin, Eamonn J. Keogh, Li Wei, Stefano Lona...
RECOMB
2008
Springer
15 years 9 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg
WABI
2004
Springer
142views Bioinformatics» more  WABI 2004»
15 years 2 months ago
Linear Reduction for Haplotype Inference
Abstract. Haplotype inference problem asks for a set of haplotypes explaining a given set of genotypes. Popular software tools for haplotype inference (e.g., PHASE, HAPLOTYPER) as ...
Jingwu He, Alexander Zelikovsky