Sciweavers

1091 search results - page 187 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
IPCO
2004
110views Optimization» more  IPCO 2004»
13 years 9 months ago
Scheduling an Industrial Production Facility
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A....
GIS
2009
ACM
14 years 9 months ago
Sea Floor Bathymetry Trackline Surface Fitting Without Visible Artifacts Using ODETLAP
High quality, artifact-free fitting a bathymetry (sea-floor) surface to very unevenly spaced depth data from ship tracklines is possible with ODETLAP (Overdetermined Laplacian Par...
Tsz-Yam Lau, W. Randolph Franklin, You Li, Zhongyi...
BMCBI
2007
197views more  BMCBI 2007»
13 years 8 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
11 years 10 months ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun