Sciweavers

17329 search results - page 3061 / 3466
» Improved non-approximability results
Sort
View
223
Voted
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 4 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
186
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
16 years 4 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
163
Voted
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 4 months ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han
218
Voted
EUROSYS
2009
ACM
16 years 4 months ago
User interactions in social networks and their implications
Social networks are popular platforms for interaction, communication and collaboration between friends. Researchers have recently proposed an emerging class of applications that l...
Christo Wilson, Bryce Boe, Alessandra Sala, Krishn...
212
Voted
EUROSYS
2007
ACM
16 years 4 months ago
Thread clustering: sharing-aware scheduling on SMP-CMP-SMT multiprocessors
The major chip manufacturers have all introduced chip multiprocessing (CMP) and simultaneous multithreading (SMT) technology into their processing units. As a result, even low-end...
David K. Tam, Reza Azimi, Michael Stumm
« Prev « First page 3061 / 3466 Last » Next »