Sciweavers

570 search results - page 78 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 8 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
IJNSEC
2008
103views more  IJNSEC 2008»
15 years 1 months ago
On Cipher Design Based on Switchable Controlled Operations
This paper concerns the problem of reducing the implementation cost of the switchable data-dependent operations (SDDOs) that are a new cryptographic primitive oriented to the desi...
Nikolay A. Moldovyan
118
Voted
JAT
2010
109views more  JAT 2010»
14 years 12 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
105
Voted
IPTPS
2003
Springer
15 years 6 months ago
SplitStream: High-Bandwidth Content Distribution in Cooperative Environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are dedicated...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
IBPRIA
2007
Springer
15 years 7 months ago
A Neural Network Model for Image Change Detection Based on Fuzzy Cognitive Maps
This paper outlines a neural network model based on the Fuzzy Cognitive Maps (FCM) framework for solving the automatic image change detection problem. Each pixel in the reference i...
Gonzalo Pajares, Alfonso Sánchez-Beato, Jes...