740 search results - page 111 / 148 » Lower bounds for Buchsbaum* complexes |
156
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
162
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
140
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
133
click to vote
ICASSP
2008
IEEE
16 years 19 days ago
2008
IEEE
This paper deals with the joint estimation of temporal (timedelay, Doppler frequency) and spatial (direction-of-arrival, DOA) parameters of several replicas of a known signal in a...
190
click to vote
CRYPTO
2007
Springer
16 years 11 days ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...