Sciweavers

980 search results - page 195 / 196
» On Negative Bases
Sort
View
ATAL
2011
Springer
12 years 6 months ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
CIKM
2011
Springer
12 years 6 months ago
Exploiting longer cycles for link prediction in signed networks
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
Kai-Yang Chiang, Nagarajan Natarajan, Ambuj Tewari...
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 8 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 8 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström