Sciweavers

719 search results - page 115 / 144
» Solving Sparse Linear Constraints
Sort
View
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 6 months ago
CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instan...
Debabrata Dash, Neoklis Polyzotis, Anastasia Ailam...
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 11 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 5 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
COLT
2005
Springer
15 years 4 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
112
Voted
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
15 years 11 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...