1647 search results - page 53 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
115
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
151
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
160
click to vote
SADM
2008
15 years 4 months ago
2008
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
115
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
191
click to vote
ACL
2006
15 years 6 months ago
2006
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...