1480 search results - page 61 / 296 » Distributed algorithms for weighted problems in sparse graph... |
86
Voted
DCC
2003
IEEE
16 years 10 days ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
93
Voted
SODA
1997
ACM
15 years 2 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
141
Voted
TSP
2010
14 years 7 months ago
2010
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
115
Voted
IJFCS
2007
15 years 20 days ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
121
click to vote
ICS
2010
Tsinghua U.
15 years 4 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...