Sciweavers

4222 search results - page 138 / 845
» Challenges in Service-Oriented Networking
Sort
View
ENTCS
2007
131views more  ENTCS 2007»
14 years 11 months ago
Secure Node Discovery in Ad-hoc Networks and Applications
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
Giovanni Di Crescenzo
JMLR
2012
13 years 1 months ago
Online Incremental Feature Learning with Denoising Autoencoders
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
Guanyu Zhou, Kihyuk Sohn, Honglak Lee
INFOCOM
2012
IEEE
13 years 1 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 1 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
ECUMN
2007
Springer
15 years 5 months ago
Utility-Based Bandwidth Allocation for Triple-Play Services
It is expected that, in near future, the multi-class traffic previously in Public Switched Telephone network (PSTN), cable television network and IP network will be multiplexed at...
Changbin Liu, Lei Shi, Bin Liu