11211 search results - page 1799 / 2243 » Data Structures |
187
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
The interference map of an 802.11 network is a collection of data structures that can help heuristics for routing, channel assignment and call admission in dense wireless networks...
185
click to vote
ACL
2007
15 years 8 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
175
click to vote
CIDR
2007
15 years 8 months ago
2007
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
184
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
166
click to vote
LREC
2010
15 years 8 months ago
2010
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...