Sciweavers

832 search results - page 28 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
71
Voted
IPPS
2006
IEEE
15 years 3 months ago
Solving generic role assignment exactly
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
Christian Frank, Kay Römer
78
Voted
IPPS
2007
IEEE
15 years 4 months ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
DFG
2009
Springer
15 years 4 months ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier
85
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
TFS
2008
120views more  TFS 2008»
14 years 8 months ago
Aggregation Using the Fuzzy Weighted Average as Computed by the Karnik-Mendel Algorithms
Abstract--By connecting work from two different problems-the fuzzy weighted average (FWA) and the generalized centroid of an interval type-2 fuzzy set--a new -cut algorithm for sol...
Feilong Liu, Jerry M. Mendel