Sciweavers

165 search results - page 30 / 33
» Type relaxed weaving
Sort
View
FOCS
2005
IEEE
14 years 1 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Knowledge Discovery Based Query Answering in Hierarchical Information Systems
The paper concerns failing queries in incomplete Distributed Autonomous Information Systems (DAIS) based on attributes which are hierarchical and which semantics at different site...
Zbigniew W. Ras, Agnieszka Dardzinska, Osman G&uum...
WINE
2005
Springer
107views Economy» more  WINE 2005»
14 years 1 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
FOCS
2002
IEEE
14 years 19 days ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
ASPLOS
1996
ACM
13 years 12 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...