Sciweavers

3678 search results - page 114 / 736
» On the Stable Paths Problem
Sort
View
NIPS
2004
15 years 2 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan
INFOCOM
2007
IEEE
15 years 7 months ago
Finding Minimum-Cost Paths with Minimum Sharability
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang
106
Voted
DATE
2002
IEEE
94views Hardware» more  DATE 2002»
15 years 5 months ago
Exact Grading of Multiple Path Delay Faults
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...
Saravanan Padmanaban, Spyros Tragoudas
106
Voted
VTC
2006
IEEE
118views Communications» more  VTC 2006»
15 years 6 months ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 5 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh