Sciweavers

1388 search results - page 120 / 278
» Approximability of Robust Network Design
Sort
View
IJCNN
2007
IEEE
15 years 10 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
ACNS
2009
Springer
152views Cryptology» more  ACNS 2009»
15 years 10 months ago
Homomorphic MACs: MAC-Based Integrity for Network Coding
Abstract. Network coding has been shown to improve the capacity and robustness in networks. However, since intermediate nodes modify packets en-route, integrity of data cannot be c...
Shweta Agrawal, Dan Boneh
124
Voted
SENSYS
2005
ACM
15 years 9 months ago
Algorithms for generic role assignment in wireless sensor networks
We consider configuration of wireless sensor networks, where certain functions must be automatically assigned to sensor nodes, such that the properties of a sensor node (e.g., rem...
Christian Frank, Kay Römer
179
Voted
CORR
2010
Springer
432views Education» more  CORR 2010»
15 years 3 months ago
A Distributed Trust Management Framework for Detecting Malicious Packet Dropping Nodes in a Mobile Ad Hoc Network
In a multi-hop mobile ad hoc network (MANET) mobile nodes communicate with each other forming a cooperative radio network. Security remains a major challenge for these networks du...
Jaydip Sen
150
Voted
JSAC
2006
199views more  JSAC 2006»
15 years 3 months ago
IDES: An Internet Distance Estimation Service for Large Networks
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
Yun Mao, Lawrence K. Saul, Jonathan M. Smith