Sciweavers

1089 search results - page 72 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SIAMJO
2010
125views more  SIAMJO 2010»
13 years 3 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
SIROCCO
2007
13 years 10 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
WASA
2009
Springer
132views Algorithms» more  WASA 2009»
14 years 3 months ago
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
Peng-Jun Wan, Zhu Wang, Zhiyuan Wan, Scott C.-H. H...
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
14 years 3 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
DIS
2005
Springer
14 years 2 months ago
Practical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masa...