Sciweavers

3211 search results - page 374 / 643
» On the Grundy Number of a Graph
Sort
View
INFOCOM
2012
IEEE
13 years 9 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 9 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
SDM
2012
SIAM
340views Data Mining» more  SDM 2012»
13 years 9 months ago
IntruMine: Mining Intruders in Untrustworthy Data of Cyber-physical Systems
A Cyber-Physical System (CPS) integrates physical (i.e., sensor) devices with cyber (i.e., informational) components to form a situation-aware system that responds intelligently t...
Lu An Tang, Quanquan Gu, Xiao Yu, Jiawei Han, Thom...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
Minming Li, Peng-Jun Wan, F. Frances Yao
FUZZIEEE
2007
IEEE
16 years 1 months ago
Social Measures and Flexible Navigation on Online Contact Networks
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
Nikolaos Korfiatis, Miguel-Ángel Sicilia