Sciweavers

1458 search results - page 280 / 292
» Monads for incremental computing
Sort
View
MOBIHOC
2005
ACM
16 years 3 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
16 years 18 days ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
CCS
2010
ACM
15 years 10 months ago
Region-based BGP announcement filtering for improved BGP security
BGP prefix hijacking is a serious security threat on the Internet. In this paper we propose a region-based BGP announcement filtering scheme (RBF) to improve the BGP security. I...
Fernando Sanchez, Zhenhai Duan
152
Voted
LCTRTS
2009
Springer
15 years 10 months ago
Addressing the challenges of DBT for the ARM architecture
Dynamic binary translation (DBT) can provide security, virtualization, resource management and other desirable services to embedded systems. Although DBT has many benefits, its r...
Ryan W. Moore, José Baiocchi, Bruce R. Chil...
138
Voted
ICDM
2009
IEEE
160views Data Mining» more  ICDM 2009»
15 years 10 months ago
Fast Online Training of Ramp Loss Support Vector Machines
—A fast online algorithm OnlineSVMR for training Ramp-Loss Support Vector Machines (SVMR s) is proposed. It finds the optimal SVMR for t+1 training examples using SVMR built on t...
Zhuang Wang, Slobodan Vucetic