Sciweavers

8903 search results - page 1589 / 1781
» Alternative
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
15 years 10 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 10 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
AIME
2009
Springer
15 years 10 months ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...
ANCS
2007
ACM
15 years 10 months ago
Frame-aggregated concurrent matching switch
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
Bill Lin, Isaac Keslassy
« Prev « First page 1589 / 1781 Last » Next »