Sciweavers

693 search results - page 48 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
BMCBI
2008
166views more  BMCBI 2008»
15 years 1 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
ICML
2006
IEEE
16 years 2 months ago
Permutation invariant SVMs
We extend Support Vector Machines to input spaces that are sets by ensuring that the classifier is invariant to permutations of subelements within each input. Such permutations in...
Pannagadatta K. Shivaswamy, Tony Jebara
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 7 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
INFOCOM
1997
IEEE
15 years 5 months ago
VBR over VBR: The Homogeneous, Loss-Free Case
We consider the multiplexing of several variable bit rate (VBR) connections over one variable bit rate connection where the multiplexing uses a multiplexing bu er of size B. The V...
Silvia Giordano, Jean-Yves Le Boudec, Philippe Oec...
130
Voted
ASUNAM
2010
IEEE
15 years 15 days ago
A Multiobjective and Evolutionary Clustering Method for Dynamic Networks
—The discovery of evolving communities in dynamic networks is an important research topic that poses challenging tasks. Previous evolutionary based clustering methods try to maxi...
Francesco Folino, Clara Pizzuti