• Publications
  • Influence
eBay in the Sky: strategy-proof wireless spectrum auctions
TLDR
We propose VERITAS, a truthful and computationally-efficient spectrum auction to support an eBay-like dynamic spectrum market. Expand
  • 449
  • 61
  • PDF
Fast and scalable layer four switching
TLDR
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source address, TCP and UDP port numbers. Expand
  • 518
  • 53
  • PDF
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
TLDR
We propose an optimal-time algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Expand
  • 328
  • 39
  • PDF
Medians and beyond: new aggregation techniques for sensor networks
TLDR
We propose a data aggregation scheme that significantly extends the class of queries that can be answered using sensor networks and demonstrate its accuracy, scalability and low resource utilization. Expand
  • 534
  • 26
  • PDF
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
TLDR
Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is inapproximable. Expand
  • 231
  • 24
  • PDF
Detecting and resolving packet filter conflicts
TLDR
This paper describes the problem and presents innovative solutions based on a geometric transformation of the problem. Expand
  • 289
  • 20
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
TLDR
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete. Expand
  • 263
  • 19
  • PDF
Label placement by maximum independent set in rectangles
TLDR
We investigate the problem of computing a large non-intersecting subset in a set of n arbitrary axis-parallel rectangles in the plane. Expand
  • 227
  • 18
  • PDF
Vickrey prices and shortest paths: what is an edge worth?
TLDR
We solve a shortest path problem that is motivated by recent interest in pricing networks or other computational resources, which in turn is prompted by the prominent role the Internet has come to play in our lives. Expand
  • 254
  • 18
  • PDF
Power aware routing for sensor databases
TLDR
In this work we explore the problem of energy efficient routing for various different types of database queries and show that in general, this problem is NP-complete. Expand
  • 114
  • 17
  • PDF