Sciweavers

844 search results - page 43 / 169
» Solving the p
Sort
View
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
15 years 4 months ago
Sparse Least-Squares Methods in the Parallel Machine Learning (PML) Framework
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...
Ramesh Natarajan, Vikas Sindhwani, Shirish Tatikon...
INFOCOM
2005
IEEE
15 years 3 months ago
Understanding XCP: equilibrium and fairness
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
Steven H. Low, Lachlan L. H. Andrew, Bartek P. Wyd...
DSN
2002
IEEE
15 years 2 months ago
A Realistic Look At Failure Detectors
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
ATAL
2004
Springer
15 years 3 months ago
A Multi-Agent System for Automatically Resolving Network Interoperability Problems
In this paper we present the Thistle multi-agent system Help Desk application for helping an end user solve network interoperability problems on their own.1
Joseph A. Giampapa, Katia Sycara-Cyranski, Austin ...
SIGAL
1990
221views Algorithms» more  SIGAL 1990»
15 years 1 months ago
Complexity Cores and Hard Problem Instances
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
Uwe Schöning