Sciweavers

5205 search results - page 1001 / 1041
» Tilings and model theory
Sort
View
POPL
2004
ACM
14 years 3 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
14 years 3 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
WOSS
2004
ACM
14 years 3 months ago
Combining statistical monitoring and predictable recovery for self-management
Complex distributed Internet services form the basis not only of e-commerce but increasingly of mission-critical networkbased applications. What is new is that the workload and in...
Armando Fox, Emre Kiciman, David A. Patterson
ACISP
2004
Springer
14 years 3 months ago
Single Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
Yan-Cheng Chang
« Prev « First page 1001 / 1041 Last » Next »