Sciweavers

667 search results - page 113 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 12 days ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 6 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
ICDCS
2007
IEEE
13 years 10 months ago
Efficient Backbone Construction Methods in MANETs Using Directional Antennas
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
MONET
2006
103views more  MONET 2006»
13 years 6 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 7 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li