Sciweavers

1132 search results - page 138 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
SIGECOM
2009
ACM
110views ECommerce» more  SIGECOM 2009»
16 years 28 days ago
On random sampling auctions for digital goods
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasa...
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 12 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
CCCG
2008
15 years 7 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
15 years 7 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour