Sciweavers

2796 search results - page 510 / 560
» The coolest path problem
Sort
View
JMLR
2010
147views more  JMLR 2010»
14 years 6 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
TALG
2010
93views more  TALG 2010»
14 years 6 months ago
Distributed error confinement
We initiate the study of error confinement in distributed applications, where the goal is that only nodes that were directly hit by a fault may deviate from their correct external...
Yossi Azar, Shay Kutten, Boaz Patt-Shamir
ICASSP
2011
IEEE
14 years 3 months ago
Sensing-aware classification with high-dimensional data
In many applications decisions must be made about the state of an object based on indirect noisy observation of highdimensional data. An example is the determination of the presen...
Burkay Orten, Prakash Ishwar, W. Clem Karl, Venkat...
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
15 years 1 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
COMCOM
2006
168views more  COMCOM 2006»
14 years 12 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen