Sciweavers

1986 search results - page 86 / 398
» Path Separability of Graphs
Sort
View
IADIS
2004
13 years 10 months ago
Open-Ended Navigation Path Planning in Self-Directed Learning on the Web
The main topic addressed in this paper is how to help a learner plan a navigation path in self-directed learning on the Web. Our approach to this issue is to analyze the open-ende...
Shinobu Hasegawa, Akihiro Kashihara
VTC
2006
IEEE
273views Communications» more  VTC 2006»
14 years 2 months ago
Path Loss Models for Air-to-Ground Radio Channels in Urban Environments
Abstract—This paper provides new statistical models for air-toground channels in an urban environment. The model is derived to operate at frequencies from 200MHz to 5GHz. Issues ...
Qixing Feng, Joe McGeehan, Eustace K. Tameh, Andre...
GLOBECOM
2007
IEEE
13 years 9 months ago
Path Planning for Network Performance
— Path planning and network design are often treated by architects of mobile communication networks as separate problems. In fact, most mobile ad hoc network (MANET) designs do n...
Alex Fridman, Steven Weber, Charles Graff, Moshe K...
JMLR
2010
151views more  JMLR 2010»
13 years 3 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
SECURWARE
2008
IEEE
14 years 3 months ago
Optimal Trust Network Analysis with Subjective Logic
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
Audun Jøsang, Touhid Bhuiyan