Sciweavers

3608 search results - page 175 / 722
» computer 2011
Sort
View
135
Voted
FTDB
2011
98views more  FTDB 2011»
14 years 7 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
IPL
2011
109views more  IPL 2011»
14 years 11 months ago
Nondominated local coteries for resource allocation in grids and clouds
The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the...
Jehn-Ruey Jiang
JSC
2011
99views more  JSC 2011»
14 years 6 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
JCT
2011
83views more  JCT 2011»
14 years 11 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
ICASSP
2011
IEEE
14 years 7 months ago
Time-lagged Directed Information
Directed Information (DI) has recently been introduced to quantify the causality between two signals. However, one major remaining issue with DI is the computational complexity wh...
Ying Liu, Selin Aviyente