2485 search results - page 462 / 497 » Time Bounded Frequency Computations |
113
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
145
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
142
click to vote
EWSN
2010
Springer
15 years 8 months ago
2010
Springer
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
140
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
145
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...