Sciweavers

17298 search results - page 3192 / 3460
» Abstract computing machines
Sort
View
FSTTCS
2010
Springer
15 years 2 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
147
Voted
GAMESEC
2010
128views Game Theory» more  GAMESEC 2010»
15 years 2 months ago
Tracking Games in Mobile Networks
Abstract. Users of mobile networks can change their identifiers in regions called mix zones in order to defeat the attempt of third parties to track their location. Mix zones must ...
Mathias Humbert, Mohammad Hossein Manshaei, Julien...
GAMESEC
2010
136views Game Theory» more  GAMESEC 2010»
15 years 2 months ago
Effective Multimodel Anomaly Detection Using Cooperative Negotiation
Abstract. Many computer protection tools incorporate learning techniques that build mathematical models to capture the characteristics of system's activity and then check whet...
Alberto Volpatto, Federico Maggi, Stefano Zanero
GLOBECOM
2010
IEEE
15 years 2 months ago
The Information Propagation Speed Upper Bound in Cognitive Radio Networks
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
Chuan Han, Yaling Yang
GLOBECOM
2010
IEEE
15 years 2 months ago
Approximation Ratios of Multicast Light-Trees in WDM Networks
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
Fen Zhou, Miklós Molnár, Bernard Cou...
« Prev « First page 3192 / 3460 Last » Next »