Sciweavers

115 search results - page 22 / 23
» Bounds on the Number of Maximal Sum-Free Sets
Sort
View
DAGSTUHL
2006
13 years 10 months ago
Taming Dynamic and Selfish Peers
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
Stefan Schmid, Fabian Kuhn, Thomas Moscibroda, Rog...
JCSS
2008
138views more  JCSS 2008»
13 years 8 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 9 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
LICS
2007
IEEE
14 years 2 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
SPAA
1999
ACM
14 years 26 days ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...