1461 search results - page 107 / 293 » The Cost of Cache-Oblivious Searching |
240
click to vote
PAIRING
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
213
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
160
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
165
click to vote
ICDS
2007
IEEE
16 years 21 days ago
2007
IEEE
— In an attempt to optimize network performance of delivered 2G and 3G services and reduce operating costs, today's mobile operators are searching for aggregation and concen...
157
click to vote
EMNLP
2007
15 years 7 months ago
2007
We describe an incremental parser that was trained to minimize cost over sentences rather than over individual parsing actions. This is an attempt to use the advantages of the two...