Sciweavers

5693 search results - page 1036 / 1139
» Socially relevant computing
Sort
View
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 1 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
200
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 1 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
175
Voted
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 1 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki

Publication
466views
16 years 1 days ago
Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Search Auctions
In pay-per click sponsored search auctions which are cur- rently extensively used by search engines, the auction for a keyword involves a certain number of advertisers (say k) c...
Akash Das Sarma, Sujit Gujar, Y. Narahari
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 11 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
« Prev « First page 1036 / 1139 Last » Next »