2157 search results - page 77 / 432 » Optimal Fast Hashing |
126
Voted
ALGORITHMICA
2005
15 years 4 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
130
click to vote
ICMCS
2000
IEEE
15 years 8 months ago
2000
IEEE
A key enabling technology for the prolikration of multima dia PC’s is the availability of fast video codeca, which are the basic building blocks of many new multimedia applicati...
145
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
122
click to vote
IOR
2007
15 years 4 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
145
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...