Sciweavers

846 search results - page 62 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
ICALP
2009
Springer
14 years 8 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
CVPR
2007
IEEE
13 years 11 months ago
Diverse Active Ranking for Multimedia Search
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
ShyamSundar Rajaram, Charlie K. Dagli, Nemanja Pet...
PAAPP
2007
104views more  PAAPP 2007»
13 years 7 months ago
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Abstract— This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling a...
Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behr...
DCOSS
2008
Springer
13 years 9 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis