Sciweavers

63 search results - page 10 / 13
» Bounds on linear PDEs via semidefinite optimization
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
TON
2008
69views more  TON 2008»
14 years 9 months ago
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
Michael J. Neely
GLOBECOM
2010
IEEE
14 years 7 months ago
Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
Weifa Liang, Jun Luo, Xu Xu
JMLR
2011
148views more  JMLR 2011»
14 years 4 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
15 years 6 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He