Sciweavers

1629 search results - page 325 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 6 months ago
Slow Adaptive OFDMA Systems Through Chance Constrained Programming
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
William Weiliang Li, Ying Jun Zhang, Anthony Man-C...
JCM
2008
242views more  JCM 2008»
13 years 6 months ago
SimANet - A Large Scalable, Distributed Simulation Framework for Ambient Networks
In this paper, we present a new simulation platform for complex, radio standard spanning mobile Ad Hoc networks. SimANet - Simulation Platform for Ambient Networks - allows the coe...
Matthias Vodel, Matthias Sauppe, Mirko Caspar, Wol...
JFR
2006
140views more  JFR 2006»
13 years 6 months ago
Improving robot navigation through self-supervised online learning
In mobile robotics, there are often features that, while potentially powerful for improving navigation, prove difficult to profit from as they generalize poorly to novel situations...
Boris Sofman, Ellie Lin, J. Andrew Bagnell, John C...
EOR
2007
165views more  EOR 2007»
13 years 6 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang
TPDS
2008
199views more  TPDS 2008»
13 years 6 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras