7930 search results - page 1488 / 1586 » Greedy in Approximation Algorithms |
131
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
135
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
137
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
115
Voted
MM
2006
ACM
15 years 9 months ago
2006
ACM
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
132
Voted
PLDI
2006
ACM
15 years 9 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...