Sciweavers

218 search results - page 32 / 44
» Constant Rate Approximate Maximum Margin Algorithms
Sort
View
91
Voted
ICALP
2003
Springer
15 years 4 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
JCO
2006
126views more  JCO 2006»
14 years 11 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
ICASSP
2010
IEEE
14 years 12 months ago
Language recognition using deep-structured conditional random fields
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
Dong Yu, Shizhen Wang, Zahi Karam, Li Deng
ICML
2009
IEEE
16 years 14 days ago
Robust bounds for classification via selective sampling
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
Nicolò Cesa-Bianchi, Claudio Gentile, Franc...
GLOBECOM
2007
IEEE
15 years 6 months ago
Non-Cooperative Power Control for Faded Wireless Ad Hoc Networks
— The problem of non-cooperative power control is studied for wireless ad hoc networks supporting data services. We develop a maximum throughput based non-cooperative power contr...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng