1331 search results - page 180 / 267 » Complexity bounds for zero-test algorithms |
121
click to vote
SIGECOM
2005
ACM
15 years 8 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...
108
click to vote
EUROCRYPT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
138
click to vote
ICPP
2002
IEEE
15 years 8 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
111
click to vote
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
217
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial ...