2194 search results - page 312 / 439 » Improving HLRTA*( k ) |
122
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
117
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
101
click to vote
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
110
click to vote
APSCC
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper presents a method of integration and implementation of transmitting video and audio data from multiple Internet Protocol (IP) surveillance cameras in a wireless sens...
109
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...