4198 search results - page 342 / 840 » In search of lost time |
319
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
168
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, the generation of 16-QAM and 64-QAM space-time trellis codes (STTCs) for several transmit antennas is considered. The main problem with an exhaustive search is the i...
234
Voted
CN
2004
15 years 6 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
199
Voted
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
Dwell time as a user behavior has been found in previous studies to be an unreliable predictor of document usefulness, with contextual factors such as the user’s task needing to...
262
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...