1478 search results - page 47 / 296 » Modular Complexity Analysis via Relative Complexity |
131
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
100
Voted
ICMCS
2005
IEEE
15 years 8 months ago
2005
IEEE
The ever-increasing complexity of generic MultimediaContent-Analysis-based (MCA) solutions, their processing power demanding nature and the need to prototype and assess solutions ...
130
Voted
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
217
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
118
click to vote
ISQED
2008
IEEE
15 years 8 months ago
2008
IEEE
An efficient frequency-based clock analysis method: CSAV is proposed in this paper. It computes the circuit response by first solving the state equation in frequency domain, and...