Sciweavers

461 search results - page 49 / 93
» Splitting NP-Complete Sets
Sort
View
INFOCOM
2007
IEEE
14 years 5 months ago
Network Coding in a Multicast Switch
— We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot...
Jay Kumar Sundararajan, Muriel Médard, MinJ...
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 3 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
BMCBI
2010
118views more  BMCBI 2010»
13 years 11 months ago
svdPPCS: an effective singular value decomposition-based method for conserved and divergent co-expression gene module identifica
Background: Comparative analysis of gene expression profiling of multiple biological categories, such as different species of organisms or different kinds of tissue, promises to e...
Wensheng Zhang, Andrea Edwards, Wei Fan, Dongxiao ...
ISCI
2007
130views more  ISCI 2007»
13 years 11 months ago
Learning to classify e-mail
In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a sup...
Irena Koprinska, Josiah Poon, James Clark, Jason C...
ICIP
2008
IEEE
15 years 22 days ago
Principal Component Analysis of spectral coefficients for mesh watermarking
This paper proposes a new robust 3-D object blind watermarking method using constraints in the spectral domain. Mesh watermarking in spectral domain has the property of spreading ...
Ming Luo, Adrian G. Bors