Sciweavers

7195 search results - page 855 / 1439
» On Computing Power
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 5 months ago
Cluster based Key Management in Wireless Sensor Networks
—Wireless sensor networks consist of sensor nodes with limited computational and communication capabilities. In this paper, the whole network of sensor nodes is divided into clus...
Anvesh Aileni
ECCC
2010
92views more  ECCC 2010»
15 years 5 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
IAJIT
2010
107views more  IAJIT 2010»
15 years 5 months ago
Low Latency, High Throughput, and Less Complex VLSI Architecture for 2D-DFT
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...
Sohil Shah, Preethi Venkatesan, Deepa Sundar, Muni...
PVLDB
2008
216views more  PVLDB 2008»
15 years 5 months ago
Ad-hoc data processing in the cloud
Ad-hoc data processing has proven to be a critical paradigm for Internet companies processing large volumes of unstructured data. However, the emergence of cloud-based computing, ...
Dionysios Logothetis, Ken Yocum
JMIV
2010
95views more  JMIV 2010»
15 years 5 months ago
Registration of 2D Points Using Geometric Algebra and Tensor Voting
In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two...
Leo Reyes-Lozano, Gérard G. Medioni, Eduard...