Sciweavers

5595 search results - page 810 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
BMCBI
2010
80views more  BMCBI 2010»
15 years 6 months ago
Sampling the conformation of protein surface residues for flexible protein docking
Background: The problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult on...
Patricia Francis-Lyon, Shengyin Gu, Joel Hass, Nin...
MOBIHOC
2008
ACM
16 years 6 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei
INFOCOM
2012
IEEE
13 years 9 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 7 months ago
Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
Bin Gao, Tie-Yan Liu, Xin Zheng, QianSheng Cheng, ...
CP
2009
Springer
16 years 1 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan