Sciweavers

1254 search results - page 67 / 251
» Making Hard Problems Harder
Sort
View
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm
ICDT
1999
ACM
82views Database» more  ICDT 1999»
14 years 1 months ago
The Data Warehouse of Newsgroups
Electronic newsgroups are one of the primary means for the dissemination, exchange and sharing of information. We argue that the current newsgroup model is unsatisfactory, especial...
Himanshu Gupta, Divesh Srivastava
SIGCOMM
2003
ACM
14 years 2 months ago
Scaling internet routers using optics
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in practice) do not provide the throughput guarantees that network operators need to ma...
Isaac Keslassy, Shang-Tse Chuang, Kyoungsik Yu, Da...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye