Sciweavers

1461 search results - page 2 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
ICALP
2003
Springer
13 years 10 months ago
Optimal Cache-Oblivious Implicit Dictionaries
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
Gianni Franceschini, Roberto Grossi
FOCS
2000
IEEE
13 years 10 months ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
AAAI
2011
12 years 5 months ago
Heuristic Search for Large Problems With Real Costs
Matthew Hatem, Ethan Burns, Wheeler Ruml
NAACL
2010
13 years 3 months ago
Improved Models of Distortion Cost for Statistical Machine Translation
The distortion cost function used in Mosesstyle machine translation systems has two flaws. First, it does not estimate the future cost of known required moves, thus increasing sea...
Spence Green, Michel Galley, Christopher D. Mannin...
WEBI
2010
Springer
13 years 3 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan