1734 search results - page 25 / 347 » its 2000 |
MVA
2000
14 years 11 months ago
2000
Abstract tion 6. When we have some estimation errors in the autoPractical problems are dealt with for augmented reality calibration, we may have a different perspective view from w...
DKE
2000
14 years 9 months ago
2000
: Large information bases that are used by several different users and applications accommodate the demands of their users more effectively, if they can be split into possibly over...
102
click to vote
ALGORITHMICA
2000
14 years 9 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
VLDB
2000
ACM
15 years 1 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...