1272 search results - page 166 / 255 » Approximate Parameterized Matching |
121
Voted
SIGDIAL
2010
14 years 10 months ago
2010
We perform a study of existing dialogue corpora to establish the theoretical maximum performance of the selection approach to simulating human dialogue behavior in unseen dialogue...
212
Voted
TCOM
2010
14 years 10 months ago
2010
Two novel receiver structures which surpass the performance of the conventional matched filter receiver are proposed for ultra-wide bandwidth multiple access communications. The pr...
122
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
170
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
122
Voted
SIGIR
1998
ACM
15 years 8 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....