95 search results - page 6 / 19 » Filling and slotting: analysis and algorithms |
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Machine recognition of hand-filled forms is a challenging task. Form processing involves many activities including form field location, field frame boundary removal and data image...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
TMC
2012
11 years 10 months ago
2012
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...